LC-0981 Medium LeetCode

981. Time Based Key-Value Store

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 49% Topics: Hash Table, String, Binary Search, Design

Reading material

Arrays & Hashing 12 min Strings 12 min Binary Search 12 min

Reference solution (spoiler · python)

# Time:  set: O(1)
#        get: O(logn)
# Space: O(n)

import collections
import bisect


class TimeMap(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.lookup = collections.defaultdict(list)

    def set(self, key, value, timestamp):
        """
        :type key: str
        :type value: str
        :type timestamp: int
        :rtype: None
        """
        self.lookup[key].append((timestamp, value))
        

    def get(self, key, timestamp):
        """
        :type key: str
        :type timestamp: int
        :rtype: str
        """
        A = self.lookup.get(key, None)
        if A is None:
            return ""
        i = bisect.bisect_right(A, (timestamp+1, 0))
        return A[i-1][1] if i else ""


# Your TimeMap object will be instantiated and called as such:
# obj = TimeMap()
# obj.set(key,value,timestamp)
# param_2 = obj.get(key,timestamp)

Solution from kamyu104/LeetCode-Solutions · MIT