Completed Design-2

hashmap.py

@@ -0,0 +1,64 @@
+class ListNode:
+    def __init__(self, key: int, value: int):
+        self.key = key
+        self.value = value
+        self.next = None
+
+class MyHashMap:
+
+    def __init__(self):
+        self.size = 1000
+        self.hashTable = [None] * self.size
+
+    def hashFunction(self, val):
+        return val % self.size
+
+    def put(self, key: int, value: int) -> None:
+        hashVal = self.hashFunction(key)
+
+        if self.hashTable[hashVal] == None:
+            self.hashTable[hashVal] = ListNode(key, value)
+            return
+        else:
+            curr = self.hashTable[hashVal]
+            prev = None
+            while curr:
+                if curr.key == key:
+                    curr.value = value
+                    return
+                prev = curr
+                curr = curr.next
+
+            if prev:
+                prev.next = ListNode(key, value)
+                return
+
+    def get(self, key: int) -> int:
+        hashVal = self.hashFunction(key)
+        curr = self.hashTable[hashVal]
+
+        while curr:
+            if curr.key == key:
+                return curr.value
+            curr = curr.next
+        return -1
+
+    def remove(self, key: int) -> None:
+        hashVal = self.hashFunction(key)
+        curr = self.hashTable[hashVal]
+        prev = None
+        if curr == None:
+            return
+        if curr.key == key:
+            self.hashTable[hashVal] = curr.next
+            curr.next = None
+            return
+        while curr:
+            if curr.key == key:
+                prev.next = curr.next
+                curr.next = None
+                return
+
+            prev = curr
+            curr = curr.next
+        return

queue.py

@@ -0,0 +1,23 @@
+class MyQueue:
+
+    def __init__(self):
+        self.instack = []
+        self.outstack = []
+
+    def push(self, x: int) -> None:
+        self.instack.append(x)
+
+    def pop(self) -> int:
+        if len(self.outstack) == 0:
+            while len(self.instack) > 0:
+                self.outstack.append(self.instack.pop())
+        return self.outstack.pop() if self.outstack else None
+
+    def peek(self) -> int:
+        if len(self.outstack) == 0:
+            while len(self.instack) > 0:
+                self.outstack.append(self.instack.pop())
+        return self.outstack[-1] if self.outstack else None
+
+    def empty(self) -> bool:
+        return len(self.outstack) == 0 and len(self.instack) == 0