Top K Frequent Elements
Medium
ArrayHash TableDivide and ConquerSortingHeapBucket Sort
Given an integer array `nums` and an integer `k`, return the `k` most frequent elements. You may return the answer in **any order**.
**Example 1:**
```
Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]
```
**Example 2:**
```
Input: nums = [1], k = 1
Output: [1]
```
Your algorithm's time complexity must be better than O(n log n), where n is the array's size.
Expected Time Complexity
O(n)
Expected Space Complexity
O(n)
Example Test Cases
Example 1
Input:
[1,1,1,2,2,3] 2
Output:
[1,2]
Example 2
Input:
[1] 1
Output:
[1]