Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Time Based Key-Value Store

Explore how to design and implement a time-based key-value store that supports storing multiple values for the same key at different timestamps. Learn to apply dictionaries and binary search methods to efficiently retrieve values for given timestamps, optimizing both time and space complexity in your structure.

We'll cover the following...

Statement

Design a data structure that can store multiple values of the same key at different timestamps and retrieve the key’s value at a certain timestamp.

Implement a struct, TimeStamp, which should provide the following functionalities:

  • NewTimeStamp(): This function initializes the values dictionary and timestamp dictionary.

  • Set Value(key, value, timestamp): This function stores the key and value at any given timestamp.

  • Get Value(key, timestamp): This function returns the value set for this key at the specified timestamp.

Note: When a query requests the value of a key at a timestamp that isn’t recorded, return the value corresponding to the most recent timestamp before the query’s timestamp. If there are no timestamps before the query’s timestamp, return an empty string.

Constraints:

  • 1≤1 \leq key.length, value.length ≤20\leq 20
  • key and value consist of lowercase English letters and digits.
  • 1≤
...