Courses › DSA
Heap
By Aditya Verma · Hindi · Intermediate
Top-K and heap based problems.
A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.
What this course covers (10 videos)
- 1 Heap Introduction and Identification (22:25)
- 2 Kth Smallest Element (10:10)
- 3 Return K largest Elements in array (9:28)
- 4 Sort a K Sorted Array | Sort Nearly Sorted Array (11:21)
- 5 K Closest Numbers (14:45)
- 6 Top K Frequent Numbers (12:37)
- 7 Frequency Sort (7:57)
- 8 K Closest Points To Origin (18:31)
- 9 Connect Ropes to Minimise the Cost (11:41)
- 10 Sum of Elements between k1 smallest and k2 smallest numbers (5:10)
More DSA courses
- Complete C++ DSA Course | Data Structures & Algorithms Playlist — Apna College · DSA · Hindi
- Complete C++ Placement DSA Course — CodeHelp - by Babbar · DSA · Hindi
- Striver's A2Z DSA Course — take U forward · DSA · English
- Algorithms — Abdul Bari · DSA · English
- Binary Search — Aditya Verma · DSA · Hindi
- Competitive Programming Course — Luv · DSA · Hindi