Top K Frequent Elements (Heap/Bucket Sort)

Question Explain

Given a non-empty list of words/numbers, return the $k$ most frequent elements. Time complexity must be better than $O(n \log n)$. Use a Min-Heap or Bucket Sort.