Create a timebased key-value store class TimeMap, that supports two operations.
1. set(string key, string value, int timestamp)

Stores the key and value, along with the given timestamp.

2. get(string key, int timestamp)

Returns a value such that set(key, value, timestamp_prev) was called previously, with timestamp_prev <= timestamp.
If there are multiple such values, it returns the one with the largest timestamp_prev.
If there are no values, it returns the empty string ("").

 

Example 1:
Input: inputs = ["TimeMap","set","get","get","set","get","get"], inputs = [[],["foo","bar",1],["foo",1],["foo",3],["foo","bar2",4],["foo",4],["foo",5]]
Output: [null,null,"bar","bar",null,"bar2","bar2"]
Explanation:   
TimeMap kv;   
kv.set("foo", "bar", 1); // store the key "foo" and value "bar" along with timestamp = 1   
kv.get("foo", 1);  // output "bar"   
kv.get("foo", 3); // output "bar" since there is no value corresponding to foo at timestamp 3 and timestamp 2, then the only value is at timestamp 1 ie "bar"   
kv.set("foo", "bar2", 4);   
kv.get("foo", 4); // output "bar2"   
kv.get("foo", 5); //output "bar2"   



Example 2:
Input: inputs = ["TimeMap","set","set","get","get","get","get","get"], inputs = [[],["love","high",10],["love","low",20],["love",5],["love",10],["love",15],["love",20],["love",25]]
Output: [null,null,null,"","high","high","low","low"]



 
Note:

All key/value strings are lowercase.
All key/value strings have length in the range [1, 100]
The timestamps for all TimeMap.set operations are strictly increasing.
1 <= timestamp <= 10^7
TimeMap.set and TimeMap.get functions will be called a total of 120000 times (combined) per test case.

Source: leetcode | Difficulty: MEDIUM_HARD
Tags: String algorithms

Sorting

Data structures

Starter code: class TimeMap:
    def __init__(self):
        """
        Initialize your data structure here.
        """
    def set(self, key: str, value: str, timestamp: int) -> None:
    def get(self, key: str, timestamp: int) -> str:
# Your TimeMap object will be instantiated and called as such:
# obj = TimeMap()
# obj.set(key,value,timestamp)
# param_2 = obj.get(key,timestamp)

Solutions:
from collections import defaultdict

class TimeMap:

	def __init__(self):
		self.d = defaultdict(list)

	def set(self, key, value, timestamp):
		self.d[key].append([timestamp, value])

	def get(self, key, timestamp):
		(start, end) = (0, len(self.d[key]) - 1)
		while start + 1 < end:
			mid = start + (end - start) // 2
			if self.d[key][mid][0] == timestamp:
				return self.d[key][mid][1]
			elif self.d[key][mid][0] < timestamp:
				start = mid
			else:
				end = mid
		if self.d[key][end][0] <= timestamp:
			return self.d[key][end][1]
		if self.d[key][start][0] <= timestamp:
			return self.d[key][start][1]
		return ''


class TimeMap(object):

	def __init__(self):
		self.map = collections.defaultdict(list)

	def set(self, key, value, timestamp):
		self.map[key].append((timestamp, value))

	def get(self, key, timestamp):
		values = self.map[key]
		if not values:
			return ''
		(left, right) = (0, len(values) - 1)
		while left < right:
			mid = (left + right + 1) // 2
			(pre_time, value) = values[mid]
			if pre_time > timestamp:
				right = mid - 1
			else:
				left = mid
		return values[left][1] if values[left][0] <= timestamp else ''


class TimeMap:

	def __init__(self):
		self.d = {}

	def set(self, key, value, timestamp):
		self.d.setdefault(key, []).append([timestamp, value])

	def get(self, key, timestamp):
		v = self.d.get(key, [])
		i = bisect.bisect_right(v, [timestamp, chr(ord('z') + 1)])
		return v[i - 1][1] if i else ''


class TimeMap:

	def __init__(self):
		self.M = collections.defaultdict(list)

	def set(self, key: str, value: str, timestamp: int) -> None:
		self.M[key].append((timestamp, value))

	def get(self, key: str, timestamp: int) -> str:
		A = self.M[key]
		if not A:
			return ''
		left = 0
		right = len(A) - 1
		while left <= right:
			mid = left + (right - left) // 2
			if timestamp == A[mid][0]:
				return A[mid][1]
			if timestamp < A[mid][0]:
				right = mid - 1
			else:
				left = mid + 1
		if right == -1:
			return ''
		return A[right][1]


class TimeMap:

	def __init__(self):
		self._data = collections.defaultdict(list)

	def set(self, key, value, timestamp):
		self._data[key].append((value, timestamp))

	def get(self, key, timestamp):
		if key not in self._data:
			return ''
		arr = self._data[key]
		(start, end) = (0, len(arr) - 1)
		while start + 1 < end:
			mid = start + (end - start) // 2
			if arr[mid][1] <= timestamp:
				start = mid
			else:
				end = mid - 1
		if arr[end][1] <= timestamp:
			return arr[end][0]
		if arr[start][1] <= timestamp:
			return arr[start][0]
		return ''