Top 50 top k Interview Questions

Use in-place Quickselect to find the kth largest array element without sorting the full input.

Arraystop kHeapTencentNew Relic

Return the top-k frequent event codes using a frequency map and bounded min-heap.

priority queuetop kQualys

Return the k largest array elements using a min-heap with O(n log k) time and O(k) space.

Maintain changing item frequencies and return the top K items using a hash map and lazy min-heap.

Data Structurestop kHeapGoldman Sachs Asset & Wealth Management

Use a heap-based priority queue to keep the k closest obstacle readings from a sensor stream.

priority queuesensor datatop kWaymo

Use a size-k heap to return the indices of the k smallest distances with deterministic tie-breaking.

Arraystop kHeapInfosys