Given an integer array nums and an integer k, return the k most frequent elements. The answer may be returned in any order.
Example:
Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]
Constraints:
1 <= nums.length <= 10^5k is always valid (1 <= k <= number of distinct elements)