Top K Frequent Elements

Question Explain

Given a non-empty array of integers, return the $k$ most frequent elements. The time complexity must be better than $O(n \log n)$. Use a Min-Heap or Bucket Sort.