Problems / Real world, medium
“People you may know” walks friends-of-friends on a graph database: 900 queries a second, 6 ms of CPU each, on 4 vCPUs.
Unlock it once for 15 credits; everything inside it is free (runs, changes, Submit, results, hints). Sign in with Google to start; new accounts get free credits.
Success ≥ 99%, p99 ≤ 500 ms.
Like a coding problem, a solution has to pass every case, not just the one it was built for. Submit in the lab runs all 6; 2 of them are hidden until then.
900 requests a second for 30 seconds: 90% reads, 10% writes.
What each component does in this design, and what calls it. The simulator mimics each one from these settings.
| Component | Its job here | Settings |
|---|---|---|
| Load balancerLoad balancer | Traffic enters here.Calls API.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header. | – |
| APIApp service | Load balancer forwards to it.Calls Redis cache (checked first), Postgres, Social graph.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s. | 3 replicas × 200 slots · timeout 1.0 s |
| Redis cacheCache | API checks it first for reads.An in-memory cache like Redis usually answers in well under a millisecond inside one region. | 95% hit rate |
| PostgresSQL database | API reads it when Redis cache misses. API calls it for writes.Postgres runs one process per connection, which is why poolers like PgBouncer sit in front of busy databases. | 8 vCPU · 60 connections |
| Social graphGraph database | API calls it for reads.Graph databases follow relationships directly, so multi-hop queries avoid large joins. | 64 slots |