Time-Based Key-Value Store

Implement TimeStore(capacity), ignoring the nonnegative capacity argument. set(key, value, timestamp) stores a string value and returns None; timestamps are nonnegative integers and arrive in nondecreasing order per key. Repeating a key/timestamp overwrites its previous value. get(key, timestamp) returns the value at the greatest stored timestamp <= query time, or None if none exists. Queries may arrive in any order. Keys and values may be empty strings. Use binary search for historical queries. Examples (JSON; null means Python None): Input: {"capacity": 0, "operations": [["set", ["a", "old", 1]], ["set", ["a", "new", 4]], ["get", ["a", 3]], ["get", ["a", 4]]]} Output: [null, null, "old", "new"] Input: {"capacity": 0, "operations": [["get", ["x", 9]], ["set", ["x", "v", 5]], ["get", ["x", 4]]]} Output: [null, null, null]

class TimeStore:

    def __init__(self, capacity: int):
        """Implement this operation according to the statement."""
        pass

    def set(self, key: str, value: str, timestamp: int) -> None:
        """Implement this operation according to the statement."""
        pass

    def get(self, key: str, timestamp: int) -> str | None:
        """Implement this operation according to the statement."""
        pass