Leetcode 347 - Top K Frequent Elements (JAVA Solution Explained!)

Leetcode 347 - Top K Frequent Elements (JAVA Solution Explained!)

If you like this video, please 'Like' or 'Subscribe'. This is really helpful for my channel and also motivates me to do more. Stay tuned!

[KaiAbyss]

I like this approach, deepens my understanding for priority queues

[alonewolf]

Nice solution
i was confuse about comparator usage .

[TruffleLover]

Super clear explanation, thank you! Please continue to make more leetcode videos!!

[moezzzz]

i love your explanation man. so easy to understand and follow. please keep them coming i will be watching all your solutions.

[mayank_singh_]

Awesome explanation sir, nice video, everything got crystal cleared.

[yangjunjie]

For the getKey is getting the frequency? Like 1 the getKey will get 3?

[priyankashaw]

Please explain time complexity of this code

[Inkarnid]

how is this the top result on youtube? It says in the question you have to do better than O(nlogn)

[devsutong]

noob here, can anyone explain the prioritize part?

[damianm]

What's the time complexity of this solution?

[gyroxaver]

bro you gotta explain your stuff more i don't know what you're doing.

[Makwayne]

Follow up: Your algorithm's time complexity must be better than O(n log n), where n is the array's size.

this was the main thing but you didn't address

[shivamdhir]

can u please explain ((a, b) -> b.getValue() - a.getValue()) ?

[tonoabad]

Excellent video!
But I don’t understand this fragment:
(a, b)-> b.getValue()-a.getValue()