Given an integer array nums and an integer k, return the k most frequent elements.
You may return the answer in any order.
kInput: [1,1,1,2,2,3] 2 Output: [1,2]
Input: [1] 1 Output: [1]
Print the result as a JSON array so it can be compared correctly.
No submissions yet.
Discuss hash maps, bucket sort, and heap-based solutions.