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.
Course outline
From promises to a write path3 puzzles
Estimate demand and decide who owns the last space.
- Can two green maps promise the last space? Define what success means before choosing storage.
- How much traffic arrives after a concert? Estimate peak demand and concurrent work with units.
- Who can grant the last space? Trace a request through two service instances and one store.
Data under concurrent use4 puzzles
Protect inventory, handle retries, page history and bound staleness.
- How does the database choose a winner? Keep the claim and the inventory change together.
- What if a successful reply disappears? Recognize a retry after the database has committed.
- Where does the next page of history begin? Order records and handle ties before choosing an index.
- Why does a confirmed space still look free? Give map reads and confirmation reads explicit freshness rules.
Distributed work4 puzzles
Deliver events, handle overload, move data and survive a partition.
- How do you send an event after a crash? Save the business change and the work it creates together.
- Why can retries prolong an outage? Calculate backlog growth and recovery time.
- When does splitting the data help? Choose a key by following the reads and writes.
- Who can confirm a write when regions cannot talk? Understand majority agreement and the cost of losing contact.
Operating and defending a design4 puzzles
Reconcile payments, diagnose delays, recover data and defend a design under changed assumptions.
- What if the space expires before payment is confirmed? Make uncertain outcomes and compensation explicit.
- Is the database slow, or is the request waiting to reach it? Connect a user-facing objective to a concrete trace.
- Can you recover the right history after a bad release? Test restoration with real reads and writes.
- Does the design survive a changed assumption? Defend a decision, then transfer it to a different domain.
Operate a busy read path4 puzzles
Route uneven work, share simultaneous cache misses and test a recovering dependency.
- Why does an idle worker watch a request wait? Route four reads and measure time spent waiting behind earlier work.
- Can two cache misses share one read? Make overlapping requests for the same reading share the work and observe how a failed read propagates.
- When is it worth calling a failing dependency again? Use failure replies and a quiet interval to control how many calls reach a recovering dependency.
- If one driver gives up, whose read should stop? Give two callers different deadlines and trace what survives the first timeout.
Practice chapters
- Guarantees under load and partial failure
- Choosing boundaries that hold during overload
- Rebuild a concert seating map from reservation events
- Follow a record through Apache Kafka
- 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.
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.
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.