Top K Frequent Elements
MediumP1Coding
Given an integer array nums and an integer k, return the k most frequent elements. You may return them in any order.
The input is chosen so the answer is unique: there is never a tie for the k-th place.
Solve it in better than O(n log n) time.
Example 1
- Input
- nums = [1,1,1,2,2,3], k = 2
- Output
- [1,2]
Example 2
- Input
- nums = [1], k = 1
- Output
- [1]
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
- 1 <= k <= number of distinct values
- The answer is unique.
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 9. ⌘Enter runs, ⌘⇧Enter submits.