init impl

Author: DreamOfTheRedChamber

Python/Hashmap/TimeBasedKeyValueMap.py

@@ -0,0 +1,48 @@
+import heapq
+import unittest
+from collections import defaultdict
+
+class TimeMap:
+
+    def __init__(self):
+        """
+        Initialize your data structure here.
+        """
+        self.valueToTimeKeyEntry = defaultdict(lambda: [])
+
+    def set(self, key: str, value: str, timestamp: int) -> None:
+        heapq.heappush(self.valueToTimeKeyEntry[key], (-timestamp, value))
+
+    def get(self, key: str, timestamp: int) -> str:
+        tempList = []
+        maxHeap = self.valueToTimeKeyEntry[key]
+
+        result = ""
+        while maxHeap:
+            topTime, topValue = heapq.heappop(maxHeap)
+            tempList.append((topTime, topValue))
+            if -topTime <= timestamp:
+                result = topValue
+                break
+
+        for item in tempList:
+            heapq.heappush(maxHeap, item)
+
+        return result
+
+class TestFailure(unittest.TestCase):
+
+    def test_failure(self):
+    #        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"]
+        timeMap = TimeMap()
+        timeMap.set("foo", "bar", 1)
+        print(timeMap.get("foo", 1))
+        print(timeMap.get("foo", 3))
+        timeMap.set("foo", "bar2", 4)
+        print(timeMap.get("foo", 4))
+        print(timeMap.get("foo", 5))
+

Python/TestDataStructureDict.py

@@ -75,13 +75,18 @@ def test_DeleteElement(self):
         del dictionary['fruit']
         print(dictionary)
 
+    @unittest.skip
     def test_NestedDefaultDict(self):
         # nestedDict = defaultdict(lambda: defaultdict(dict))
 
         nestedDict = defaultdict(defaultdict)
         nestedDict[0][1] = 2
         print(nestedDict[0][1])
 
+    def test_NestedDefaultDictGetValue(self):
+        startToEndAndTotalTime = defaultdict(lambda: defaultdict(lambda: (0, 0)))
+        totalTime, num = startToEndAndTotalTime["spa"][0]
+        print(totalTime)
 
 if __name__ == '__main__':
     unittest.main()

Python/TestUtilities.py

@@ -20,12 +20,18 @@ def test_bisectSearch(self):
         print("The rightmost index to insert, so list remains sorted is  : ", end="")
         print(bisect.bisect_right(li, 4))
 
+    @unittest.skip
     def test_collectionsCounter(self):
         li = [1, 3, 4, 4, 4, 6, 7]
 
         # returns a default dictionary
         result = collections.Counter(li)
         self.assertEqual(0, result[0])
 
+    def test_mod(self):
+        i = -2
+        a = i % 4
+        print(a)
+
 if __name__ == '__main__':
     unittest.main()