Top K Frequent Elements | Leetcode 347 | Min/Max Heap 🔥🔥 | Live coding session

preview_player
Показать описание
Here is the solution to "Top K Frequent Elements" leetcode question. Hope you have a great time going through it.

🎉 Chapters
0:00 Introduction
1:00 Understanding the question
3:00 Step by Step Algorithm Build up
5:20 Coding it up

👉 Solutions

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

wow i am followng ur all videos and ur intutions are very good, i feel comfertable as i also code in java, keep going.

DhananjayKumar-vntc
Автор

Could you please tell the lambda expression part that you used in the PriorityQueue bro? Like what it does, I know it arranges the values based on the max frequency but when you used b[1]-a[1] will it compare two different first indices of two integer arrays ? Could you please explain this part bro

luffymonkey