Top K Frequent Elements (LeetCode 347) | Full solution with examples | Interview | Study Algorithms

Nikhil Lohia
Nikhil Lohia
23.2 هزار بار بازدید - 2 سال پیش - Finding the top k frequent
Finding the top k frequent elements in an array is not similar to finding the top k students in a class. We need to understand the problem statement clearly, what it is expected. In this video we look at example test cases on how to determine the top k frequent elements efficiently using the bucket sort algorithm. All of this along with a dry-run of code in JAVA.

Actual problem on LeetCode: https://leetcode.com/problems/top-k-f...

Chapters:
00:00 - Intro
01:06 - Problem statement and description
03:29 - How to approach the problem?
06:49 - Solving for efficiency
11:32 - Dry-run of Code
14:13 - Final Thoughts

📚 Links to topics I talk about in the video:
Brute Force Method: Brute Force algorithms with real life...
Bucket Sort Algorithm: Brute Force algorithms with real life...
Other problems on LeetCode: Leetcode Solutions

📘 A text based explanation is available at: https://studyalgorithms.com

Code on Github: https://github.com/nikoo28/java-solut...
Test-cases on Github: https://github.com/nikoo28/java-solut...

📖 Reference Books:
Starting Learn to Code: https://amzn.to/36pU0JO
Favorite book to understand algorithms: https://amzn.to/39w3YLS
Favorite book for data structures: https://amzn.to/3oAVBTk
Get started for interview preparation: https://amzn.to/39ysbkJ

🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalg...

🎥 My Recording Gear:
Recording Light: https://amzn.to/3pAqh8O
Microphone: https://amzn.to/2MCX7qU
Recording Camera: https://amzn.to/3alg9Ky
Tablet to sketch and draw: https://amzn.to/3pM6Bi4
Surface Pen: https://amzn.to/3pv6tTs
Laptop to edit videos: https://amzn.to/2LYpMqn


💻 Get Social 💻
Follow on Facebook at: Facebook: studyalgos
Follow on Twitter at: Twitter: studyalgorithms
Follow on Tumblr at: Tumblr: studyalgos
Subscribe to RSS feeds: https://studyalgorithms.com/feed/
Join fan mail: http://eepurl.com/g9Dadv

#interview #leetcode #algorithms
2 سال پیش در تاریخ 1401/03/30 منتشر شده است.
23,227 بـار بازدید شده
... بیشتر