dsa2 min read
Top K Frequent Elements
Return the K most frequent elements using a frequency map plus min-heap, or bucket sort for O(n) solution.
Read →
Bucket-sort
2 articles
dsa2 min read
Amazon — Top K Frequent Elements (Bucket Sort / Heap)
Find the k most frequent elements using a max-heap or bucket sort. O(n) bucket sort approach using frequency as bucket index — faster than O(n log n) heap.
Read →