eBay OA Question 2024 June | Heap & Sorting | on-campus

Question: Top K 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. Constraints 1 <= nums.length <= 105 -104 <= nums[i] <= 104 k is in the range [1, the number of unique elements in the array]. It is guaranteed that the answer is unique. Examples Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Explanation 1: 1 appears 3 ...