Although there is no means of writing a blog post today for interview preparation, as I was not able to do anything today because of my office work and my toothache. Still, I tried to solve one question today which I will be sharing with you all
Top K Frequent Elements: Given a non-empty array of integers, return the k most frequent elements.
Input: nums = [1,1,1,2,2,3], k = 2
Input: nums = , k = 1
- You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
- Your algorithm’s time complexity must be better than O(n log n), where n is the array’s size.
- It’s guaranteed that the answer is unique, in other words the set of the top k frequent elements is unique.
- You can return the answer in any order.
I thought of going with hashmaps one of my favorites to calculate the frequency of each integer and then iteration the map to list, and finally, add 1st k letters to the array and print the result