System Design Interview Problem Breakdowns
Welcome to the System Design Interview Problem Breakdowns master repository. This comprehensive directory covers 48 battle-tested real-world system design interview questions frequently asked at FAANG/MAMAA (Meta, Apple, Amazon, Netflix, Google), Uber, Stripe, ByteDance, and high-growth infrastructure startups.
Every breakdown is engineered through the lens of a Staff / Principal Architect (senior-architect-review), providing:
- Mathematical Capacity Sizing: Quantitative calculations for QPS, bandwidth, RAM, and 5-year storage projections.
- Deterministic Data Models: Exact relational and NoSQL schemas with physical primary/secondary indexes and sharding keys.
- Physical Engine Mechanics: B+Tree page traversal, LSM compaction (memtable, WAL, SSTable), buffer pools, and kernel syscalls.
- Distributed Realism & Concurrency: Redis Lua scripts, distributed locks, optimistic vs pessimistic locking, 2PC, Saga compensation, and idempotent deduplication.
- Architectural Trade-Off Matrix: Quantitative evaluations of competing design decisions (e.g. Fan-out-on-write vs Fan-out-on-read, Push vs Pull).
- Candidate Level Expectations: Granular performance bars expected from Mid-Level (L4), Senior (L5), and Staff+ (L6/Principal) engineers.
The 45-Minute System Design Interview Blueprint
Mastering system design requires disciplined time management and active conversation leadership:
ββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
β 45-MINUTE SYSTEM DESIGN TIMELINE BREAKDOWN β
ββββββββββββββββ¬ββββββββββββββββββββββββββββββ¬ββββββββββββββββββββββββββββββββββββ€
β Minute 00-05 β Scope & Requirements β Clarify functional requirements, β
β β (Clarification) β non-functional SLAs, and scale. β
ββββββββββββββββΌββββββββββββββββββββββββββββββΌββββββββββββββββββββββββββββββββββββ€
β Minute 05-10 β High-Level Design β Core entities, REST/gRPC API, and β
β β (The Backbone) β initial end-to-end block flow. β
ββββββββββββββββΌββββββββββββββββββββββββββββββΌββββββββββββββββββββββββββββββββββββ€
β Minute 10-30 β Detailed Component Design β Deep dive into storage engines, β
β β (The Engine) β caching tiers, message brokers. β
ββββββββββββββββΌββββββββββββββββββββββββββββββΌββββββββββββββββββββββββββββββββββββ€
β Minute 30-40 β Bottlenecks & Failure Modes β Hotspots, split-brain, network β
β β (Staff-Level Depth) β partitions, backpressure, quorum. β
ββββββββββββββββΌββββββββββββββββββββββββββββββΌββββββββββββββββββββββββββββββββββββ€
β Minute 40-45 β Summary & Trade-Off Matrix β Honest pros/cons, metrics review, β
β β (Wrap-Up) β and candidate Q&A. β
ββββββββββββββββ΄ββββββββββββββββββββββββββββββ΄ββββββββββββββββββββββββββββββββββββ
Master Problem Breakdown Matrix (48 Real-World Systems)
The problems below are categorized by primary architectural challenge and ordered from foundational classics to ultra-scale distributed infrastructure:
1. High-Frequency Classics
| # | System Design Problem | Category | Complexity | Core Mechanics & Distributed Patterns |
|---|---|---|---|---|
| 1 | Bitly (URL Shortener) | Distributed Storage | Medium | Base62 vs Hashing, Range-based KGS, 301 vs 302 caching, Redis read cache |
| 2 | Dropbox (File Storage & Sync) | Cloud Storage | Hard | Chunking, Rolling Hash (Rabin Fingerprint), Merkle Tree sync, S3 + Metadata DB |
| 3 | Local Delivery Service (Gopuff) | E-Commerce / Logistics | Hard | Dark store inventory reservation, Redis Lua 2-phase lock, batching & dispatch |
| 4 | Ticketmaster (Ticket Booking) | Concurrency / Booking | Hard | High-concurrency seat locking, distributed waiting room, seat release TTL |
| 5 | Facebook News Feed | Social Networks | Hard | Push vs Pull vs Hybrid fanout, Redis timeline cache, ML ranking pipeline |
| 6 | Tinder (Proximity Matchmaking) | Geospatial / Matching | Hard | Geohash/Quadtree indexing, swipe write-buffer, mutual match detection |
2. Real-Time & High-Throughput Streams
| # | System Design Problem | Category | Complexity | Core Mechanics & Distributed Patterns |
|---|---|---|---|---|
| 7 | LeetCode (Code Execution Engine) | Sandboxing / Compute | Hard | gVisor/Docker isolation, async judge worker pool, security jail, timeout aborts |
| 8 | WhatsApp (Real-Time Messaging) | Real-Time Comm | Hard | Netty/Erlang WebSocket gateways, ephemeral queues, offline store, E2EE |
| 9 | Distributed Rate Limiter | Infra / API Security | Medium | Token bucket vs Sliding window counter, Redis Lua script, local token batching |
| 10 | YouTube (Video Streaming) | Media / Streaming | Hard | Transcoding DAG, chunked upload, HLS/DASH manifests, CDN edge caching |
| 11 | Facebook Live Comments | Streaming / Fan-Out | Hard | High-velocity comment ingestion, sliding-window throttling, WebSockets |
| 12 | YouTube Top K / Trending | Stream Processing | Hard | Count-Min Sketch, Min-Heap, Flink sliding window streaming, Lamport clocks |
3. Location, Search & Data Ingestion
| # | System Design Problem | Category | Complexity | Core Mechanics & Distributed Patterns |
|---|---|---|---|---|
| 13 | Uber (Ride-Hailing & Dispatch) | Geospatial / Dispatch | Hard | Uber H3 hexagonal spatial indexing, driver location stream, trip state machine |
| 14 | Web Crawler | Distributed Scraping | Hard | Distributed URL frontier, politeness queues, Bloom filter deduplication, DNS |
| 15 | Ad Click Aggregator | Big Data / Analytics | Hard | Kafka event stream, Flink window aggregation, exact-once deduplication, OLAP |
| 16 | Facebook Post Search | Search / Information Retrieval | Hard | Distributed inverted index, partition by post vs term, real-time search engine |
| 17 | Yelp (Local Business Reviews) | Geospatial / Search | Medium | Proximity search (Google S2/QuadTree), business review rollup, read caching |
| 18 | Instagram (Photo Sharing & Feed) | Media / Social | Hard | Photo upload pipeline, S3/CloudFront, hybrid feed generation, follower graph |
4. Workflows, Schedulers & Aggregation
| # | System Design Problem | Category | Complexity | Core Mechanics & Distributed Patterns |
|---|---|---|---|---|
| 19 | Strava (GPS Activity & Segments) | Geospatial / Telemetry | Hard | GPS polyline map matching (R-Tree/PostGIS), segment leaderboards, Redis ZSET |
| 20 | Distributed Cache (Redis/Memcached) | Infra / Distributed Memory | Hard | Consistent hashing ring, virtual nodes, W-TinyLFU eviction, Raft consensus |
| 21 | Online Auction Platform (eBay) | Real-Time / Concurrency | Hard | Real-time bidding engine, countdown clock extension, high-contention mutex |
| 22 | Distributed Job Scheduler | Infra / Async Compute | Hard | Hierarchical timing wheel, Redis ZSET delay queue, worker lease & heartbeat |
| 23 | Google News (News Aggregator) | Aggregation / ML | Hard | Feed scraper, SimHash near-duplicate clustering, TF-IDF / vector ranking |
| 24 | CamelCamelCamel (Price Tracker) | Crawling / Time-Series | Medium | Product price scraper, time-series storage, alert trigger engine, webhooks |
5. Enterprise, Finance & AI Systems
| # | System Design Problem | Category | Complexity | Core Mechanics & Distributed Patterns |
|---|---|---|---|---|
| 25 | Notification System | Infra / Messaging | Medium | Priority queues, provider failover (APNS/FCM/Twilio), rate limiting, templates |
| 26 | Robinhood (Stock Trading) | Fintech / Low-Latency | Hard | Order matching engine (LMAX Disruptor), double-entry ledger, FIX protocol |
| 27 | Google Docs (Collaborative Editor) | Distributed Consistency | Hard | Operational Transformation (OT) vs CRDT (Yjs), client-server sync, cursor state |
| 28 | Payment System (Stripe) | Fintech / Transactions | Hard | Double-entry ledger, idempotency keys, PSP orchestration, reconciliation cron |
| 29 | Metrics Monitoring (Datadog) | Observability / TSDB | Hard | TSDB LSM-tree (Gorilla compression), PromQL engine, alert rule evaluator |
| 30 | Online Chess Platform | Gaming / Real-Time | Medium | Move validation engine, chess clock synchronization, WebSocket game room, Elo |
| 31 | ChatGPT (LLM Inference Gateway) | AI / Streaming | Hard | SSE token streaming, prompt queuing, KV cache routing, vLLM / Triton |
| 32 | Flash Sale System | Concurrency / Peak Load | Hard | Traffic surge absorption, Redis token bucket gating, atomic inventory CAS |
6. Storage Engines, Distributed Primitives & Enterprise Platforms
| # | System Design Problem | Category | Complexity | Core Mechanics & Distributed Patterns |
|---|---|---|---|---|
| 33 | Key-Value Store (Dynamo/Cassandra) | Distributed Storage | Hard | Consistent hashing ring, virtual nodes, vector clocks, tunable quorum (), hinted handoff, Merkle trees |
| 34 | Distributed File System (GFS/HDFS) | Large-Scale Storage | Hard | Master/Chunkserver architecture, 64MB chunking, in-memory metadata WAL, pipelined data chain, atomic appends |
| 35 | Netflix (Video Streaming) | Media / Streaming | Hard | Open Connect CDN (OCA), VMAF per-title encoding ladder, DASH/CMAF 2-4s chunks, Multi-DRM, buffer-based ABR |
| 36 | Spotify (Audio Streaming) | Media / Audio | Hard | Ogg Vorbis/AAC chunking (first 10s instant buffer), collaborative playlist fractional indexing, Annoy vector search |
| 37 | Email System (Gmail) | Enterprise Messaging | Hard | SMTP/IMAP/POP3 gateways, SPF/DKIM/DMARC, distributed mail spooling, LSM mailbox, per-user search index |
| 38 | Google Maps (Routing Engine) | Geospatial / Routing | Hard | Vector map tiles (Protobuf), Contraction Hierarchies (CH), bidirectional A*, live traffic speed aggregation |
| 39 | Search Autocomplete (Typeahead) | Search / Low-Latency | Medium | Prefix Trie with precomputed Top-5, serialized Trie cache, client debouncing, Flink sampling pipeline |
| 40 | Google Search Engine | Search / Big Data | Hard | Document-centric inverted index sharding, delta compression, skip lists, PageRank + BM25, SimHash |
| 41 | Google Calendar | Scheduling / Productivity | Hard | RFC 5545 iCalendar RRULE dynamic expansion, timezone/DST handling, RSVP state machine, room conflict locking |
| 42 | Issue Tracker (Jira / Linear) | Enterprise / Workflows | Hard | Configurable workflow state machine, optimistic concurrency control, real-time WebSocket board sync, JQL parser |
| 43 | Shopping Cart (Amazon) | E-Commerce / Storage | Hard | Always-writable Dynamo AP model (), guest-to-user session merge, vector clocks Add-Wins, CRDT PN-Counter |
| 44 | Pastebin (Text Sharing) | Distributed Storage | Medium | Base62 unique IDs, tiered storage (hot Redis vs cold S3), dual-tier TTL expiration, syntax highlight caching |
| 45 | Cookie Consent Platform (CMP) | Infra / Privacy & Compliance | Hard | Edge CDN policy evaluation (<10ms via Cloudflare Workers), Geo-IP matching, IAB TCF v2.2 encoding, Merkle audit trail |
| 46 | Nearby Friends (Real-Time Location Fanout) | Geospatial / Real-Time Fanout | Hard | WebSocket connection gateways, sharded Redis Pub/Sub cluster, consistent hash ring, Geohash 8-neighbor expansion |
| 47 | Digital Wallet (Distributed Ledger) | Fintech / Distributed Transactions | Hard | Double-entry bookkeeping, 1M TPS in-memory event sourcing, Try-Confirm/Cancel (TC/C), Raft consensus replication |
| 48 | Stock Exchange (Matching Engine) | Fintech / Ultra-Low-Latency | Hard | Price-Time Priority LOB (Skip List + Doubly Linked List), LMAX Disruptor lock-free ring buffer, deterministic sequencer, reliable UDP multicast (ITCH/OUCH) |
Fundamental Numbers Every Candidate Must Know
Keep these hardware and latency figures at your fingertips during capacity planning:
βββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ
β LATENCY NUMBERS EVERY ARCHITECT KNOWS β
βββββββββββββββββββββββββββββββββββββββββββ¬ββββββββββββββββββββ€
β L1 cache reference β 0.5 ns β
β Branch mispredict β 5 ns β
β L2 cache reference β 7 ns β
β Mutex lock/unlock β 25 ns β
β Main memory reference β 100 ns β
β Compress 1K bytes with Zstandard β 2,000 ns (2 Β΅s) β
β Send 1K bytes over 10 Gbps network β 1,000 ns (1 Β΅s) β
β Read 1 MB sequentially from memory β 250,000 ns (250Β΅s)β
β Round trip within same datacenter β 500,000 ns (0.5ms)β
β Read 1 MB sequentially from NVMe SSD β 1,000,000 ns (1ms)β
β Read 1 MB sequentially from Magnetic HDDβ 20,000,000 ns(20msβ
β Send packet CA to Netherlands & back β 150 ms β
βββββββββββββββββββββββββββββββββββββββββββ΄ββββββββββββββββββββ
