Spatial indexing driver matching
Design the spatial indexing layer for a real-time driver-matching system: find the K nearest available drivers to a rider's location within a radius, in a city with up to 100k concurrently moving drivers each emitting a location update every 4 seconds, with p99 match-query latency under 50ms. Drivers' availability flips constantly. Describe the spatial index structure, how you handle the extreme update rate (every driver moves constantly), how nearest-K-within-radius queries run, and the central trade-off.
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.