Top k most frequent
Mediumarrayhash mapsortingbucket sort
Return the k values that appear most often in nums, in any order. The answer is guaranteed to be unique (no tie for the last place).
Example 1
Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2]
Example 2
Input: nums = [4], k = 1 Output: [4]
Constraints
- 1 ≤ nums.length ≤ 10⁵
- 1 ≤ k ≤ number of distinct values
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int[]} nums
* @param {int} k
* @return {int[]}
*/
function topKFrequent(nums, k) {
}