Workspace

Dashboard Learn Handbook Labs Practice library Learning paths Review Insights Studios Mock interviews Notebook

Personal workspace · self-hosted

Search

Jump to a problem, path or page

Distributed Key-Value Store · Brief · designlab

Dashboard Learn Handbook Labs Practice library Learning paths Review Insights Studios Mock interviews Notebook

Search

Jump to a problem, path or page

Library ArchitectureDistributed Key-Value Store

⚿

Distributed Key-Value Store

HLDAdvanced50 minStorage & partitioning Consistency & transactions Reliability & recovery Guided lab

All changes saved Not started

01 · Understand the problem

Your mission

Design a Dynamo-style key-value store. Each key is stored on several nodes. Clients choose how many replicas must acknowledge a write and answer a read, trading consistency, latency and availability.

02 · Define success

Requirements

Partition keys across nodes with consistent hashing.
Replicate each key to N nodes.
Let writes and reads succeed with W and R acknowledgements.
Stay available for reads and writes when one replica is down.

Open the design canvas Read the analysis first

Design envelope

6,000
peak reads / s: 3,000
writes / s: 200 ms
target read p99: 1000 B
record size

Workload assumptions for this exercise, not measured production limits.

Think about request flow, durable state, hot paths and failure boundaries.

How this problem works

Design — place components and connect them on the canvas, then write your contracts.
Decide — pick the policies you would defend and note the trade-offs.
Review — run the rule-based review. Pass every check to complete the problem and add it to your review deck.

The review checks a guided model. Other valid architectures exist; it does not execute code or prove production readiness.