Flipkart Associate Developer Interview Question 2025 March | Heaps and Bucket Sort | on-campus

Question 1 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] The answer is unique — it is guaranteed that the answer is unique Examples Example 1: Input: nums = [1, 1, 1, 2, 2, 3], k = 2 ...