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