t=1v1t=3v2t=5v3
mediumBlind 75

Time Based Key-Value Store

Each key holds multiple values at different timestamps, and you need the most recent value at or before a given time. Interviewers love it because it reveals your binary search precision—one wrong boundary update can loop forever. The trap is boundary drift. Nail this and temporal queries become second nature.

Arrays & HashingBinary SearchDesign
👩‍🏫
👨‍💼

Meet Allison & Tim

Your AI coaches

Practice coding interviews out loud with real-time voice coaching. Your code actually runs.

Free · No sign up · Early access

Desktop required to run this problem

StrongYes runs real code + tests in a desktop editor. Mobile is view-only for now, so you can’t start this here. Sorry about that — email yourself a link and pick it up on your computer.

1Simple Cacheeasy
2Part 2
3Part 3
4Part 4

Start Part 1 to unlock your next challenge

Based onLeetCode

Desktop required

Sorry — mobile can’t run the editor + tests yet. Email yourself a link to continue on desktop.