How do you find the kth largest element efficiently? — ServiceNow interview
Reported in ServiceNow interview loops. Heap and selection strategy question with multiple valid approaches.
Interview atlas
Explore 105 curated Q&As across 1 employers — filter by career stage, round, or company.
Filtered ServiceNow ×
Reported in ServiceNow interview loops. Heap and selection strategy question with multiple valid approaches.
Reported in ServiceNow interview loops. Advanced string window question seen in strong coding interviews.
Reported in ServiceNow interview loops. Graph traversal question using DFS or BFS flood-fill.
Reported in ServiceNow interview loops. Topological sort and directed cycle detection interview staple.
Reported in ServiceNow interview loops. Dynamic programming optimization with unbounded choices.
Reported in ServiceNow interview loops. Simple but important recurrence-based DP interview problem.
Reported in ServiceNow interview loops. Data structure trade-off question for autocomplete and dictionary lookups.
Reported in ServiceNow interview loops. Hard interview classic requiring binary search partition logic.
Reported in ServiceNow interview loops. Disjoint set union structure used in graph connectivity interviews.
Reported in ServiceNow interview loops. Pattern recognition question for linear-time array scans.
Reported in ServiceNow interview loops. System design problem testing reliability, fan-out, and channel abstraction.
Reported in ServiceNow interview loops. Design question around large files, durability, and secure uploads.
Reported in ServiceNow interview loops. System design interview around indexing, ranking, and freshness.
Reported in ServiceNow interview loops. Critical design topic focused on correctness under retries and failures.
Reported in ServiceNow interview loops. Geo-spatial system design covering matching latency and surge logic.