Day 82 — Revision: redraw every design

revision day · system design · diagram recall

Tonight's goal: redraw all seven system-design architectures from memory, then check each one against its lesson diagram. No LeetCode tonight; keep doing 2 DSA problems daily.

Tonight's protocol

Adapted from Lesson 26 — How to Run a Revision Day: blank paper, no hints, and the check happens only after the memory attempt.

  1. 0:00-0:04: Answer the warm-up MCQs below. Do not open the source lessons yet.
  2. 0:04-0:05: Put one blank page per design on paper. Write only the design name at the top.
  3. 0:05-0:12: Redraw scaling basics. Then open Lesson 57 and check the diagram for missing boxes, arrows, and the CAP partition.
  4. 0:12-0:19: Redraw caching. Then check the lesson diagram for hit path, miss path, write path, and database truth.
  5. 0:19-0:26: Redraw load balancing. Then check the lesson diagram for DNS, health checks, server pool, and consistent hash ring.
  6. 0:26-0:33: Redraw database choices. Then check replicas, shards, indexes, and the access-pattern router.
  7. 0:33-0:40: Redraw URL shortener. Then check create path, redirect path, hot-link cache, database, and analytics queue.
  8. 0:40-0:47: Redraw rate limiter. Then check key, policy, budget store, allowed path, and 429 deny path.
  9. 0:47-0:54: Redraw chat system. Then check WebSocket gateways, message store, delivery queue, workers, presence, and receipts.
  10. 0:54-1:00: Put every failed redraw on the Day 89 list with one line: missing: <box, arrow, or invariant>.

The problem menu

No LeetCode tonight. The problems are the seven architecture redraws below; use the links only after each memory attempt.

Redraw targetPattern nameCheck against
Scaling basics Scale up, scale out, CAP partition Lesson 57 diagram
Caching Cache-aside with miss, write, eviction policy Lesson 58 diagram
Load balancing Healthy server pool plus consistent hashing Lesson 59 diagram
Database choices Replication, sharding, indexes per access pattern Lesson 60 diagram
URL shortener Tiny write path, enormous redirect path Lesson 61 diagram
Rate limiter Budget by key inside a window Lesson 62 diagram
Chat system Fan-out over persistent WebSocket connections Lesson 63 diagram

Warm-up MCQs

1. Which memory sentence belongs to scaling basics?

2. A cache answer must name which three decisions?

3. When keyed traffic uses consistent hashing, what is protected?

4. Which choice matches the database choices invariant?

5. URL shortener has which hot path?

6. Which pair is correct for limiter and chat?

Self-check gate

Pass tonight if

All seven designs were redrawn before looking, and each redraw includes the main boxes, arrows, bottleneck, and invariant from its source lesson.

Failure path: any diagram you cannot redraw cleanly goes on the Day 89 list. Write exactly what failed: missing box, wrong arrow, fuzzy bottleneck, or forgotten invariant.

After the redraw session, keep the daily baseline: 2 DSA problems from the plan. They are separate from tonight's system-design revision.