Content-addressed deduplicating blob store
Design a content-addressed (CAS) deduplicating blob store for a backup/file-sync product holding 5 exabytes where the same byte ranges recur heavily across users (OS images, shared docs, common media). Blobs are split into variable-length content-defined chunks; identical chunks must be stored exactly once and shared across millions of users, while deletes must be safe (deleting your file must not corrupt mine). Target: write dedup at ingest, sub-100ms chunk-existence checks, and reclaiming space when the last reference to a chunk goes away.
What a strong answer looks like
Clarify scale and constraints first. Propose a clean component breakdown, then go deep on the hard parts (data model, bottlenecks, consistency, failure modes) and name the trade-offs you are making.
Clarify5:00 left
Estimate5:00 planned
Design15:00 planned
Deep dive12:00 planned
Failure8:00 planned
Which questions mattered is sealed until you submit. Telling you now would just be handing over the edge cases.
Run or narrate your approach, then ask the coach.