Skip to main content
mediumNeetCode 150

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

Chat with Fin or Coco right now on mobile.

Start talking through the problem here. Switch to desktop when you're ready to code and run tests.

Start coaching session
Coco
Fin

Meet your coaches

Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.

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

Start Part 1 to unlock your next challenge

Based onLeetCode

Code + tests need a desktop

Chat works on this phone. Email yourself a link when you want the editor and tests.