Top k most frequent numbers

#1

i am able to understand the question and sample test cases if we get frequency more than one then what we have to do and if we create heap then how to print the element after every iteration?

#2

@aditikandhway,
If you haven’t encountered k distinct elements till now, then print all distinct elements, else print the top k frequent ones only.
Hint, don’t use heap.

#3

than which data structure should i use for implementation?

#4

@aditikandhway,
You can use set and maps.

#5

i haven’t studied map till now so is there any other method to solve this question?

#6

i haven’t studied map till now so is there any other method to solve this question?

#7

@aditikandhway,
You can skip this problem for now, and come back to it latter. I really like the map approach, and recommend you do it ones you have done maps.

#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.