Skip to main content

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:

  1. Mathematical Capacity Sizing: Quantitative calculations for QPS, bandwidth, RAM, and 5-year storage projections.
  2. Deterministic Data Models: Exact relational and NoSQL schemas with physical primary/secondary indexes and sharding keys.
  3. Physical Engine Mechanics: B+Tree page traversal, LSM compaction (memtable, WAL, SSTable), buffer pools, and kernel syscalls.
  4. Distributed Realism & Concurrency: Redis Lua scripts, distributed locks, optimistic vs pessimistic locking, 2PC, Saga compensation, and idempotent deduplication.
  5. Architectural Trade-Off Matrix: Quantitative evaluations of competing design decisions (e.g. Fan-out-on-write vs Fan-out-on-read, Push vs Pull).
  6. 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 ProblemCategoryComplexityCore Mechanics & Distributed Patterns
1Bitly (URL Shortener)Distributed StorageMediumBase62 vs Hashing, Range-based KGS, 301 vs 302 caching, Redis read cache
2Dropbox (File Storage & Sync)Cloud StorageHardChunking, Rolling Hash (Rabin Fingerprint), Merkle Tree sync, S3 + Metadata DB
3Local Delivery Service (Gopuff)E-Commerce / LogisticsHardDark store inventory reservation, Redis Lua 2-phase lock, batching & dispatch
4Ticketmaster (Ticket Booking)Concurrency / BookingHardHigh-concurrency seat locking, distributed waiting room, seat release TTL
5Facebook News FeedSocial NetworksHardPush vs Pull vs Hybrid fanout, Redis timeline cache, ML ranking pipeline
6Tinder (Proximity Matchmaking)Geospatial / MatchingHardGeohash/Quadtree indexing, swipe write-buffer, mutual match detection

2. Real-Time & High-Throughput Streams

#System Design ProblemCategoryComplexityCore Mechanics & Distributed Patterns
7LeetCode (Code Execution Engine)Sandboxing / ComputeHardgVisor/Docker isolation, async judge worker pool, security jail, timeout aborts
8WhatsApp (Real-Time Messaging)Real-Time CommHardNetty/Erlang WebSocket gateways, ephemeral queues, offline store, E2EE
9Distributed Rate LimiterInfra / API SecurityMediumToken bucket vs Sliding window counter, Redis Lua script, local token batching
10YouTube (Video Streaming)Media / StreamingHardTranscoding DAG, chunked upload, HLS/DASH manifests, CDN edge caching
11Facebook Live CommentsStreaming / Fan-OutHardHigh-velocity comment ingestion, sliding-window throttling, WebSockets
12YouTube Top K / TrendingStream ProcessingHardCount-Min Sketch, Min-Heap, Flink sliding window streaming, Lamport clocks

3. Location, Search & Data Ingestion

#System Design ProblemCategoryComplexityCore Mechanics & Distributed Patterns
13Uber (Ride-Hailing & Dispatch)Geospatial / DispatchHardUber H3 hexagonal spatial indexing, driver location stream, trip state machine
14Web CrawlerDistributed ScrapingHardDistributed URL frontier, politeness queues, Bloom filter deduplication, DNS
15Ad Click AggregatorBig Data / AnalyticsHardKafka event stream, Flink window aggregation, exact-once deduplication, OLAP
16Facebook Post SearchSearch / Information RetrievalHardDistributed inverted index, partition by post vs term, real-time search engine
17Yelp (Local Business Reviews)Geospatial / SearchMediumProximity search (Google S2/QuadTree), business review rollup, read caching
18Instagram (Photo Sharing & Feed)Media / SocialHardPhoto upload pipeline, S3/CloudFront, hybrid feed generation, follower graph

4. Workflows, Schedulers & Aggregation

#System Design ProblemCategoryComplexityCore Mechanics & Distributed Patterns
19Strava (GPS Activity & Segments)Geospatial / TelemetryHardGPS polyline map matching (R-Tree/PostGIS), segment leaderboards, Redis ZSET
20Distributed Cache (Redis/Memcached)Infra / Distributed MemoryHardConsistent hashing ring, virtual nodes, W-TinyLFU eviction, Raft consensus
21Online Auction Platform (eBay)Real-Time / ConcurrencyHardReal-time bidding engine, countdown clock extension, high-contention mutex
22Distributed Job SchedulerInfra / Async ComputeHardHierarchical timing wheel, Redis ZSET delay queue, worker lease & heartbeat
23Google News (News Aggregator)Aggregation / MLHardFeed scraper, SimHash near-duplicate clustering, TF-IDF / vector ranking
24CamelCamelCamel (Price Tracker)Crawling / Time-SeriesMediumProduct price scraper, time-series storage, alert trigger engine, webhooks

5. Enterprise, Finance & AI Systems

#System Design ProblemCategoryComplexityCore Mechanics & Distributed Patterns
25Notification SystemInfra / MessagingMediumPriority queues, provider failover (APNS/FCM/Twilio), rate limiting, templates
26Robinhood (Stock Trading)Fintech / Low-LatencyHardOrder matching engine (LMAX Disruptor), double-entry ledger, FIX protocol
27Google Docs (Collaborative Editor)Distributed ConsistencyHardOperational Transformation (OT) vs CRDT (Yjs), client-server sync, cursor state
28Payment System (Stripe)Fintech / TransactionsHardDouble-entry ledger, idempotency keys, PSP orchestration, reconciliation cron
29Metrics Monitoring (Datadog)Observability / TSDBHardTSDB LSM-tree (Gorilla compression), PromQL engine, alert rule evaluator
30Online Chess PlatformGaming / Real-TimeMediumMove validation engine, chess clock synchronization, WebSocket game room, Elo
31ChatGPT (LLM Inference Gateway)AI / StreamingHardSSE token streaming, prompt queuing, KV cache routing, vLLM / Triton
32Flash Sale SystemConcurrency / Peak LoadHardTraffic surge absorption, Redis token bucket gating, atomic inventory CAS

6. Storage Engines, Distributed Primitives & Enterprise Platforms

#System Design ProblemCategoryComplexityCore Mechanics & Distributed Patterns
33Key-Value Store (Dynamo/Cassandra)Distributed StorageHardConsistent hashing ring, virtual nodes, vector clocks, tunable quorum (R+W>NR+W>N), hinted handoff, Merkle trees
34Distributed File System (GFS/HDFS)Large-Scale StorageHardMaster/Chunkserver architecture, 64MB chunking, in-memory metadata WAL, pipelined data chain, atomic appends
35Netflix (Video Streaming)Media / StreamingHardOpen Connect CDN (OCA), VMAF per-title encoding ladder, DASH/CMAF 2-4s chunks, Multi-DRM, buffer-based ABR
36Spotify (Audio Streaming)Media / AudioHardOgg Vorbis/AAC chunking (first 10s instant buffer), collaborative playlist fractional indexing, Annoy vector search
37Email System (Gmail)Enterprise MessagingHardSMTP/IMAP/POP3 gateways, SPF/DKIM/DMARC, distributed mail spooling, LSM mailbox, per-user search index
38Google Maps (Routing Engine)Geospatial / RoutingHardVector map tiles (Protobuf), Contraction Hierarchies (CH), bidirectional A*, live traffic speed aggregation
39Search Autocomplete (Typeahead)Search / Low-LatencyMediumPrefix Trie with precomputed Top-5, serialized Trie cache, client debouncing, Flink sampling pipeline
40Google Search EngineSearch / Big DataHardDocument-centric inverted index sharding, delta compression, skip lists, PageRank + BM25, SimHash
41Google CalendarScheduling / ProductivityHardRFC 5545 iCalendar RRULE dynamic expansion, timezone/DST handling, RSVP state machine, room conflict locking
42Issue Tracker (Jira / Linear)Enterprise / WorkflowsHardConfigurable workflow state machine, optimistic concurrency control, real-time WebSocket board sync, JQL parser
43Shopping Cart (Amazon)E-Commerce / StorageHardAlways-writable Dynamo AP model (W=1W=1), guest-to-user session merge, vector clocks Add-Wins, CRDT PN-Counter
44Pastebin (Text Sharing)Distributed StorageMediumBase62 unique IDs, tiered storage (hot Redis vs cold S3), dual-tier TTL expiration, syntax highlight caching
45Cookie Consent Platform (CMP)Infra / Privacy & ComplianceHardEdge CDN policy evaluation (<10ms via Cloudflare Workers), Geo-IP matching, IAB TCF v2.2 encoding, Merkle audit trail
46Nearby Friends (Real-Time Location Fanout)Geospatial / Real-Time FanoutHardWebSocket connection gateways, sharded Redis Pub/Sub cluster, consistent hash ring, Geohash 8-neighbor expansion
47Digital Wallet (Distributed Ledger)Fintech / Distributed TransactionsHardDouble-entry bookkeeping, 1M TPS in-memory event sourcing, Try-Confirm/Cancel (TC/C), Raft consensus replication
48Stock Exchange (Matching Engine)Fintech / Ultra-Low-LatencyHardPrice-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 β”‚
β””β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”΄β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”€β”˜

πŸ“–
Track Page Progress0 / 635 Read
Knowledge Base Completion0%