Section 14: Heap / Priority Queue

📚 Vanakkam DSA Course (24 sections) · Hope AI — ML & DS Course

Lessons

#	Lesson Name	Duration	Notes
1	Introduction to Heap	-
2	Kth Largest Element in an Array	-
3	Kth Largest Element in a Stream	-
4	Last Stone Weight	-
5	Top K Frequent Elements	-
6	Kth Smallest Element in a Sorted Matrix	-
7	Find Median from Data Stream	-
8	Task Scheduler (Heap approach)	-

Progress Checklist

• [ ] Introduction to Heap
• [ ] Kth Largest Element in an Array
• [ ] Kth Largest Element in a Stream
• [ ] Last Stone Weight
• [ ] Top K Frequent Elements
• [ ] Kth Smallest Element in a Sorted Matrix
• [ ] Find Median from Data Stream
• [ ] Task Scheduler (Heap approach)

My Notes

Add your notes here as you progress through the section...