Tier 3 — Pending Futures, Linked Pointers & Locally Optimal Commitments
M3.3: The Top-K Escalator & Dual-Heap Balance Scale
Bottleneck: The brute-force bottleneck this module eliminates — see M3.3-heaps-and-tries/README.md.
Pre-launch
This module is still in the pre-launch phase.
This site is a YC preview. Only M0.1 — memory boxes and the 10^8 ops/sec clock — ships video, audio, the quiz, and the toy. M3.3 stays on the syllabus so the map is honest; the filmed lesson is not in this build.
Open the live M0.1 lesson →Planned problems · 4
- Kth Largest Element
- Find Median from Data Stream
- Merge K Sorted Lists
- Trie Implementation