Code RoomBounded-staleness follower reads
HardPrep Room Coding #3425

Bounded-staleness follower reads

System designDatabases & SQLDistributed systemsSenior–Staff~45 min

A globally-replicated database (one leader per range, async followers in other regions) wants to serve reads from the local follower for latency, but stale-follower reads break two guarantees users notice: read-your-own-writes (a user updates their profile, then re-reads from a follower and sees the OLD value) and monotonic reads (a later read returns older data than an earlier one). Design the follower-read mechanism that gives bounded-staleness or consistent local reads without sending every read to the leader, and the trade-off between latency and freshness.

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
0:00
Which questions mattered is sealed until you submit. Telling you now would just be handing over the edge cases.