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