Time Based Key Value Store Problem

Time Based Key Value Store Problem — ExecCode Medium DSA Practice

Solve the Time Based Key Value Store problem on ExecCode. Free online medium DSA practice in Design. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description Design a time-based key-value data structure that can store multiple values for the same key at different time stamps and retrieve the key's value at a certain timestamp. Implement the TimeMap class: TimeMap() Initializes the object of the data structure. void set(String key, String value, int timestamp) Stores the key key with the value value at the given time timestamp. String get(String key, int timestamp) Returns a value such that set was called previously, with timestampprev <= timestamp. If there are multiple such values, it returns the value associated with the largest timestampprev. If there are no values, it returns "". Constraints 1 <= key.length, value.length <= 100 key and value consist of lowercase English letters and digits. 1 <= timestamp <= 10^7 All the timestamps timestamp of set are strictly increasing. At most 2 * 10^5 calls will be made to set and get.

Examples

Input {"raw": "5\nset foo bar 1\nget foo 1\nget foo 3\nset foo bar2 4\nget foo 4"}; Output bar bar bar2. Input {"raw": "4\nset foo bar 1\nset foo bar2 4\nget foo 3\nget foo 4"}; Output bar bar2

Constraints

1 <= key.length, value.length <= 100 key and value consist of lowercase English letters and digits. 1 <= timestamp <= 10^7 All the timestamps timestamp of set are strictly increasing. At most 2 * 10^5 calls will be made to set and get.

Practice Time Based Key Value Store free on ExecCode. Browse DSA problems, topic map, and placement guides.