If we iterate over the heap it will become costly operation.
What can be a logic for this problem?How to update a number's frequency in heap?
You can do this question without using heap .
Refer this https://www.geeksforgeeks.org/find-top-k-or-most-frequent-numbers-in-a-stream/
For heap based approach, read this discussion Top k most frequent in a stream of integers
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.