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