Top K Frequent Elements

## 🔢 K Most Frequent Elements

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

---

### Example

Input


nums = [1, 1, 1, 2, 2, 3]
k = 2


Output


[1, 2]


Explanation:
Element 1 appears 3 times, 2 appears 2 times, and 3 appears once.
The two most frequent elements are 1 and 2.

---

### Constraints

* 1 ≤ nums.length ≤ 10⁵
* −10⁴ ≤ nums[i] ≤ 10⁴
* 1 ≤ k ≤ number of unique elements