Top k most frequent number in a stream

[yutikakhanna]

i am uanble to do this question.
pls tell the code.

[pratyush63 (Pratyush Kumar)]

Top k most frequent in a stream of integers

Sorry, my bad. I mistook this to another question where there is no query type. I have explained you the approach for this question https://leetcode.com/problems/top-k-frequent-elements/ For such a case the above approach which i have explained will work. In this you only have to empty the heap once…only at the end when you have to print the result. For your question, a very similar approach would be followed as i have explained earlier.Just one difference is there that you have to empty your …

Refer this.

[yutikakhanna]

pls tell in the form of a code

[pratyush63 (Pratyush Kumar)]

Coding Blocks IDE

Dry run this and check. The approach is same as i have explained in the above link.