Learn
Learn by watching it run
52 lessons, each one idea walked through with an animated diagram you can step, replay and pause. Every lesson links back to the full notes.
System Design
From one request to planet-scale systems, one animated step at a time.
01. Foundations
- 01How a Request TravelsFollow one request hop by hop and see what each layer adds. 7 minBeginner 8 steps
- 02Back-of-Envelope MathTurn traffic and data numbers into servers, storage and bandwidth. 7 minBeginner 8 steps
- 03Latency & PercentilesWhy averages lie and the slowest 1% decides how fast you feel. 6 minBeginner 7 steps
- 04From One Server to ManyGrow a system stage by stage, adding each piece only when it is needed. 8 minBeginner 9 steps
- 05Availability & the NinesHow components in series lose nines and redundancy wins them back. 6 minBeginner 7 steps
02. Traffic & Edge
- 06DNS ResolutionHow a name becomes an address, and why TTLs decide failover speed. 6 minBeginner 7 steps
- 07Content Delivery NetworksServe bytes from the edge, and know what happens on a miss. 6 minBeginner 7 steps
- 08Load BalancingSpread traffic across servers and route around the ones that fail. 8 minBeginner 8 steps
- 09Gateways, Proxies & MeshesWhere auth, routing and retries live between clients and services. 6 minIntermediate 7 steps
- 10CachingCache-aside, write patterns, eviction and the stampede problem. 9 minIntermediate 6 steps
- 11Rate LimitingToken bucket, sliding window and where to enforce a limit. 8 minIntermediate 6 steps
03. Data & Storage
- 12SQL vs NoSQLPick a data store from the access pattern, not the hype. 7 minBeginner 7 steps
- 13Indexes & Storage EnginesB-trees for reads, LSM trees for writes, and what each costs. 8 minIntermediate 8 steps
- 14ReplicationLeaders, followers, lag, and what a failover can lose. 8 minIntermediate 8 steps
- 15ShardingSplit data across machines and choose a key that will not hot-spot. 8 minIntermediate 8 steps
- 16Consistent HashingResize a fleet of servers and move only a small slice of the data. 8 minIntermediate 10 steps
- 17Object Storage & UploadsPresigned URLs keep large files off your servers. 6 minBeginner 7 steps
- 18Search & Inverted IndexesHow a search engine finds documents by word in milliseconds. 7 minIntermediate 7 steps
04. Communication
- 19Queues & StreamsDecouple producers from consumers and absorb bursts. 8 minIntermediate 6 steps
- 20Real-Time UpdatesPolling, long polling, SSE and WebSockets side by side. 7 minBeginner 6 steps
- 21REST, gRPC & GraphQLThree ways to shape an API and when each one fits. 7 minBeginner 6 steps
- 22Events & the OutboxPublish events reliably without dual writes. 8 minAdvanced 6 steps
05. Distributed Systems
- 23CAP & PACELCDuring a partition you pick consistency or availability. Otherwise, latency. 7 minIntermediate 7 steps
- 24Consistency ModelsStrong, read-your-writes, monotonic and eventual, shown with real reads. 8 minIntermediate 8 steps
- 25Time & OrderingClocks drift, so order events with logical clocks instead. 8 minAdvanced 8 steps
- 26Consensus with RaftElect a leader, replicate a log, survive failures. 9 minAdvanced 9 steps
- 27Locks, Leases & FencingWhy a distributed lock needs a fencing token to be safe. 7 minAdvanced 7 steps
- 28Isolation Levels & AnomaliesDirty reads, lost updates and write skew, and the level that stops each. 8 minAdvanced 8 steps
- 292PC & SagasCommit across services, or compensate when you cannot. 8 minAdvanced 6 steps
- 30Idempotency & Exactly-OnceMake retries safe with idempotency keys and dedup. 7 minIntermediate 5 steps
06. Reliability & Operations
- 31Timeouts, Retries & BreakersStop one slow dependency from taking the whole system down. 8 minIntermediate 8 steps
- 32Multi-Region DesignActive-passive vs active-active, and what each costs you. 8 minAdvanced 7 steps
- 33Cells & Shuffle ShardingShrink the blast radius so one bad tenant hurts few others. 7 minAdvanced 7 steps
- 34SLIs, SLOs & Error BudgetsTurn reliability into a number you can spend. 6 minIntermediate 7 steps
- 35ObservabilityMetrics, logs and traces, and how a trace follows a request. 7 minIntermediate 7 steps
- 36Deployment StrategiesRolling, blue-green and canary releases with safe rollback. 7 minIntermediate 6 steps
- 37Backups & Disaster RecoveryRPO and RTO, and the backup strategies that hit them. 6 minIntermediate 6 steps
Data Structures & Algorithms
The interview patterns, traced element by element.
01. Foundations
02. Arrays & Strings
- 02Sliding WindowGrow and shrink a window instead of rescanning every subarray. 8 minBeginner 9 steps
- 03Two PointersWalk inward from both ends of a sorted array in one pass. 7 minBeginner 8 steps
- 04Prefix Sum & Hash MapCount subarrays that sum to k, even with negative numbers. 7 minIntermediate 8 steps
- 05Cyclic SortPut each number in its own index and find what is missing. 6 minIntermediate 7 steps
- 06Merge IntervalsSort by start, then merge or insert in one sweep. 7 minBeginner 8 steps
- 07Monotonic StackFind the next greater element for every item in O(n). 7 minIntermediate 8 steps
03. Linked Lists
04. Trees & Heaps
- 10Tree BFSVisit a tree level by level with a queue. 7 minBeginner 8 steps
- 11Tree DFSRecurse down paths and carry state back up. 7 minBeginner 8 steps
- 12Two HeapsKeep a running median with a max-heap and a min-heap. 8 minAdvanced 9 steps
- 13Top K ElementsA size-k heap beats sorting everything. 7 minIntermediate 8 steps
- 14K-way MergeMerge k sorted lists with a min-heap of heads. 7 minIntermediate 7 steps
- 15TrieShare prefixes to search words and autocomplete fast. 7 minIntermediate 8 steps