Implement a timestamped map

Q: Implement a timestamped map

This question evaluates a candidate's ability to implement time-indexed key-value storage, covering data structure design, versioning semantics, and algorithmic complexity for efficient reads and writes.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Loading...

Implement an in-memory timestamped map.

Support these operations:

put(key, value, timestamp) : store value for key at the given integer timestamp
get(key, timestamp) : return the value written for key at the greatest timestamp less than or equal to timestamp ; return an empty string if no such value exists

Additional notes:

for the same key, writes arrive in strictly increasing timestamp order
keys and values are strings
aim for efficient reads and writes

Implement a timestamped map

Quick Overview

Comments (0)