GuideTechnology
14 min read
Design the suggestions that appear as users type in a search box: requirements and estimates per keystroke, why querying the database per keystroke fails, an offline pipeline that turns search logs into prefix-to-top-K tables or tries, in-memory serving, client debouncing and CDN caching, trending updates, sharding and replication, privacy filtering and failures.
GuideTechnology
16 min read
Design a home feed that shows posts from accounts a user follows: estimates for posting, reading and fan-out, fan-out on read versus fan-out on write, the hybrid model that handles celebrity accounts, precomputed feed storage, hydration, ranking with a chronological fallback, cursor pagination, deletions and privacy, and what changes at social-media scale.
GuideTechnology
15 min read
Design an in-memory cache service shared by many applications: requirements and estimates, the get/set/delete API, a single-node design with TTLs and LRU eviction, then partitioning with consistent hashing or hash slots, client-side versus proxy routing, replication and failover, rebalancing, hot keys, cache stampedes, and what consistency a cache can and cannot promise.
GuideTechnology
20 min read
The classic first system design problem, worked end to end with the course's method: requirements, estimates, APIs, data model, a simple baseline, short-code generation and collisions, 301 versus 302 redirects, caching a read-heavy path, expiry, analytics off the critical path, sharding, failures, abuse prevention, and the Pastebin variant with object storage.
GuideTechnology
17 min read
How large files are stored and delivered: object storage concepts (buckets, keys, durability, consistency, lifecycle), direct uploads with presigned URLs and multipart upload, and CDNs (edge caching, cache keys, TTLs, invalidation versus versioned URLs, static versus dynamic content, private content). Includes a compact file-storage-and-sharing design.
GuideTechnology
20 min read
Caching as a design decision: where caches live, hit ratios, cache-aside, read-through, write-through and write-back, TTLs and invalidation, LRU and other eviction policies, cache stampedes, hot keys, negative caching and distributed caches such as Redis, with the trade-off between faster reads, stale data and invalidation complexity.
GuideTechnology
15 min read
Turn request rates into the numbers that shape an architecture: storage per day and per year with replication and retention, ingress and egress bandwidth in Gbps, cache memory from the working set, database write limits, and a first server count with headroom and zone failure. Includes a full worked example and a calculator.
