Pre-launch · YC preview · Always $0

Bottleneck-to-breakthrough DSA.

Preview M0.1: Memory Boxes, Arrays & The 10^8 Ops/Sec Clock

Checking this device for a resume point…

02 · Outcomes

What you will learn

Read N and pick a complexity class before you type.
Name the physical machine (ledger, inchworm, bouncer, dye) from three clue words.
Dry-run a 5-element trace and a 2-element boundary before the editor.
Spot the twin trap that looks 95% the same and breaks the pattern.
Keep the $1 0^{8}$ ops/sec budget honest on every nested loop.
Leave each module with four OA-shaped problems, not a highlight reel.

7 tiers · 26 modules · 104 problems · 1 live in this preview

7 sections · 26 lectures · M0.1 is live; the rest of the map is pre-launch

Phase 0 — Zero-Floor Visual Foundations4 lectures

Tier 1 — Instant Lookup, In-Place Marking & Prefix Compression3 lectures

Tier 2 — Sorted Order, Converging Pointers & Monotonic Boundaries4 lectures

Tier 3 — Pending Futures, Linked Pointers & Locally Optimal Commitments3 lectures

Tier 4 — Recursive Decision Trees, Structural Induction & Subtree Contracts4 lectures

Tier 5 — Overlapping Subproblems & State-Space Compression4 lectures

Tier 6 — Network Propagation, Dependencies & Weighted Wavefronts4 lectures