Top K Frequent Elements — When HashMaps Start Earning Their Salary

Given an integer array nums and an integer k, return the k most frequent elements within the array. The test cases are generated such that the answer is always unique. Example 1: Input: nums = [1,2,2,