223. Top K Frequent Elements

MediumHash Table

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

Examples

Input: [1,1,1,2,2,3] 2

Output: [1,2]

Explanation: 1 appears 3 times, 2 appears 2 times.

Constraints

  • 1 <= nums.length <= 10^5
  • -10^4 <= nums[i] <= 10^4
  • k is in the range [1, the number of unique elements in the array].
  • It is guaranteed that the answer is unique.
Loading...

Run checks all cases above. Submit evaluates all test cases.