Coding Trainer
Top K Frequent Elements
Problem
Given array nums and integer k, return the k most frequent elements. Better than O(n log n).
Example: nums=[1,1,1,2,2,3], k=2 → [1,2]