mediumHeap & Priority Queue
Top K Frequent Elements
## Problem
Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.
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
nums = [1,1,1,2,2,3], k = 2
Output
[1,2]
1 appears 3 times, 2 appears 2 times.
Input
nums = [1], k = 1
Output
[1]
Only one element.
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.
Python
Loading...