Top k frequent elements in an array

Approach

• Count frequencies with HashMap.
• Min-heap of size k by frequency, or bucket sort when k is small.

Java Solution

public int[] topKFrequent(int[] nums, int k) {
    Map<Integer,Intege…