gorav@gyanbyte ~ $ cat README.md
Engineering,
explained down to
the last byte.
Deep dives on system design, distributed systems and backend internals, plus every coding pattern you need to clear a MAANG loop. Real benchmarks, tested code, no fluff.
358deep dives
255solved problems
27system designs
29free courses
design-url-shortener.md
# 1. requirements ✓ 100M new URLs / day → ~1,160 writes/s ✓ read:write = 100:1 → ~116K reads/s ✓ p99 redirect < 50ms # 2. estimate storage = 100M × 365 × 500B = ~18 TB/yr ids = base62, 7 chars = 3.5 × 10¹² # 3. high-level client → LB → api → cache → kv-store ↘ id-gen (snowflake) # 4. deep dive ? 301 vs 302: analytics or cacheability? ? hot keys: who owns the celebrity link?
→ read the full design walkthrough
$ ls tracks/maang/
all 29 courses →maang/coding-interview-patterns
Every pattern behind the coding round, with each problem on its own page: intuition, dry run, complexity.
maang/cracking-system-design-interview
The framework, back-of-the-envelope maths, and full designs from URL shortener to Ticketmaster.
maang/cracking-the-behavioral-interview
STAR, a story bank, Amazon's leadership principles, and a two-week prep plan.
$ git log --latest
all 358 articles →$ problem --today
EASY · LC 387
First Unique Character in a String
Find the index of the first character that appears once: count everything, then scan in order.
# pattern
Hash map — count, then scan
Hash map — count, then scan
$ grep -c topics
$ subscribe --weekly
One deep dive a week, in your inbox
System design, AI engineering, trading systems and interview prep. Tested code, real numbers. Free, and you can unsubscribe any time.
or read it on gyanbyte.substack.com