Free courses · 19 puzzles · 5 practice chapters · Final project

System design from first principles to design review

Design a parking service that can refuse the last space, survive a lost reply and recover its booking history. Trace each decision in a diagram, then inspect the rows or timings that would prove it wrong.

Start learning Browse modules

Course outline

Practice chapters

  1. Guarantees under load and partial failure
  2. Choosing boundaries that hold during overload
  3. Rebuild a concert seating map from reservation events
  4. Follow a record through Apache Kafka
  5. Design a search across independent shards

Final project

Defend the last seat under peak load · Design the admission and reservation paths for assigned concert seats. The reviewer will interrupt the most awkward transaction and ask which promises still hold.

How the course works

Start with the two-driver reservation. Use Run SQL to change the data in your browser, Worked code for Python 3, or Run code to compare JavaScript scenarios. The transaction lesson lets you switch between commit and rollback. Finish by defending a design for a different workload.

Every puzzle is open from this outline. The check at the end of a puzzle unlocks its next button and saves your progress in this browser.

How lessons are written and checked · Your learning

Take it with you

Continue with Claude

Copies a prompt that turns Claude into your tutor for this course: what you've passed, the words you know, the questions you slipped on, and how to teach you, one small block at a time. Paste it into Claude, or any AI assistant. Built in your browser from your progress; nothing is sent anywhere.

Open Claude →

Download for Obsidian

The whole course as an Obsidian vault: a note per puzzle linked to the puzzles it builds on (open the graph view to see the building blocks), practice chapters with worked cases, a final project, a glossary, and puzzle flashcards for the Spaced Repetition plugin.

Download the vault (.zip) ↓