Find Top K Most Frequent Elements | Java Code | Programming Tutorials

Given a non-empty array of integers, find the top k most frequent elements. In this tutorial, I have explained the algorithm and it's java code to find top k frequent elements.

[Vicbomlen]

I've seen this solution before but I had trouble understanding it, it's clear to me now thanks to your explanation. Thank you!

[basmam.mostafa]

That's a great solution. Thank you sir

[aishwaryaraman]

great Video man !!
But just a doubt, if we take array as {1, 1, 1, 2, 2, 3, 3, 3, 4, 4} and k=3 the answer turns out to be 1, 3, 2, 4 but we need only 3 elements. How could that be solved.?

[purnimavijaya]

are you taking care of duplicates in your list?

[maymerari]

Thank you! what is the runtime of this solution?

[evarryl]

hey just curious, i have tried this solution on leetcode, but runtime is 48ms, 0%tile y so?

[yadnyeshrane]

I am not getting why u have done k=k-list.sie pl help me out

[maxqin]

the bucket takes too much space. it is not a good solution.