Add one node to the ring to relieve the hotspot.

A key is served by the first node clockwise. Tap a candidate slot to place the new node — only the slice of keys in its arc re-homes (≈ K/n), not the whole keyspace. Minimise the busiest node's load.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

tap a + slot to add a node

Consistent Hashing — practice the decision, scored against the optimum

What does the Consistent Hashing puzzle teach?

Placing a node on the ring relieves the hotspot — and only the slice of keys in its arc re-homes, not the whole keyspace.

Why do interviews ask about this?

Consistent hashing is THE distributed-systems interview question: shard with minimal reshuffling when you add or lose a node.

How is it scored?

The engine computes the provably-optimal answer for the exact instance you played (dynamic programming, shortest-path, or exhaustive search — never a heuristic) and scores your attempt as a percentage of it. No login needed to see your score.

← Arena

Practice0:00

Consistent Hashing · D5

Add one node to the ring to relieve the hotspot.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

tap a + slot to add a node