Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

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. 1 Heap Introduction and Identification (22:25)
  2. 2 Kth Smallest Element (10:10)
  3. 3 Return K largest Elements in array (9:28)
  4. 4 Sort a K Sorted Array | Sort Nearly Sorted Array (11:21)
  5. 5 K Closest Numbers (14:45)
  6. 6 Top K Frequent Numbers (12:37)
  7. 7 Frequency Sort (7:57)
  8. 8 K Closest Points To Origin (18:31)
  9. 9 Connect Ropes to Minimise the Cost (11:41)
  10. 10 Sum of Elements between k1 smallest and k2 smallest numbers (5:10)

More DSA courses