Data Structures & Algorithms
Heaps & Priority Queues
Pattern-first mastery of heap problems — the complete-binary-tree mental model, canonical templates, and 16 FAANG-grade patterns in Python and TypeScript.
- Theory Heaps — Fundamentals Heap property, array-level-order layout, and the mental shortcuts behind every priority-queue problem.
- Pattern 01 Top K Selection
- Pattern 02 K-way Merge
- Pattern 03 Two Heaps — Order Statistics
- Pattern 04 Frequency-based
- Pattern 05 Greedy Combine
- Pattern 06 Scheduling with Heap