Field Log11 lessons10 calculators22 stepped diagrams

System Design, day by day

One chapter a day from System Design Interview, rebuilt. Every claim is tied to a number, every diagram can be stepped through, and the key trade-offs are calculators you can drag rather than conclusions you have to accept. The quizzes are interview scenarios, not recall.

Part A — Foundations

Day 1

From one server to a website: DNS, web tier, database

One request end to end, what DNS actually does, and why statelessness is the reason the tiers get split.

● interactive — step a request through DNS, the resolution chain and the tier split
DNSTTLtiersSQL vs NoSQL
Day 2

Scaling out: load balancers, replication, cache, CDN

Five moves in order, each with the bottleneck it clears and the bill it creates. Includes the replication-lag bug.

● interactive — drag the cache hit rate; step the replication-lag bug
load balancerreplicascacheCDNstateless
Day 3

Back-of-the-envelope estimation: QPS, storage, availability

The rounding shortcuts, latency on human scale, and the availability arithmetic almost everyone gets backwards.

● interactive — size any system from assumptions; compose availability
QPSlatencynines
Day 4

A 4-step framework for any system design interview

The clock, the eight clarifying questions, and what to say when you are behind or do not know.

● interactive — scrub the interview clock minute by minute
scopingtime budgetscripts

Part B — Building blocks

Day 5

Design a rate limiter: token bucket, sliding window, Redis

Five algorithms drawn, the exact moment the cheap one leaks, and atomic counting across a fleet.

● interactive — a token bucket that refills in real time; fixed vs sliding window
token bucketsliding windowRedis429
Day 6

Consistent hashing: why hash % N breaks and how to fix it

Drive the ring yourself: add and remove servers and watch the moved-key counter against plain modulo.

● interactive — drive the hash ring; real remap counts computed in-browser
hash ringvirtual nodesrebalancing
Day 7

Design a key-value store: partitioning, replication, consistency

CAP as a concrete three-node scenario, the W + R > N overlap proof, and three repair mechanisms.

● interactive — pick N, W and R and watch the quorum overlap
CAPquorumvector clocksMerkle trees
Day 8

Unique ID generation in distributed systems: snowflake

64 bits drawn to scale, three IDs minted field by field, and what a backwards clock actually costs.

● interactive — spend the 64-bit budget and watch the capacities trade
snowflakebit budgetclock skewUUIDv7
Day 9

Design a URL shortener: encoding, hashing, 301 vs 302

Why the redirect code is a one-way decision, and why base 62 beats hashing.

● interactive — convert base 62 both ways, with the division ladder
301 vs 302base 62hot keys
Day 10

Design a web crawler: BFS frontier, politeness, dedup

Front queues pick what, back queues pick when — and a burst against one host becomes unrepresentable.

● interactive — take the politeness queues away and get your crawler blocked
BFSpolitenessBloom filterrobots.txt
Day 11

Design a notification system: queues, retries, fan-out

Take the SMS vendor down and watch what happens to push and email. Then find the crash that beats dedupe.

● interactive — kill the SMS vendor; find the crash that beats dedupe
queuesat-least-oncebackoffdedupe

Built on System Design Interview — An Insider's Guide, Vol. 1 by Alex Xu, chapters 1–10. Diagrams, simulators, worked arithmetic and quiz scenarios are added here; sources are cited per lesson.