Snowflake SWE Interview Question 2024 May | HashMaps | off-campus

Question 1: 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. Your algorithm's time complexity must be better than O(n log n), where n is the array's size. 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 ...