s30 design-2 completed - hashmap and queue from stacks

hashmap.py

@@ -0,0 +1,27 @@
+class MyHashMap:
+
+    def __init__(self):
+        self.map = [-1] * (10 ** 6 + 1)
+
+    def put(self, key: int, value: int) -> None:
+        self.map[key] = value
+
+    def get(self, key: int) -> int:
+        return self.map[key]
+
+    def remove(self, key: int) -> None:
+        self.map[key] = -1
+
+# Your MyHashMap object will be instantiated and called as such:
+# obj = MyHashMap()
+# obj.put(key,value)
+# param_2 = obj.get(key)
+# obj.remove(key)
+
+# Time complexity
+# put	O(1)
+# get	O(1)
+# remove	O(1)
+
+#Space Complexity:
+# O(10^6)

queue_from_stack.py

@@ -0,0 +1,37 @@
+class MyQueue:
+
+    def __init__(self):
+        self.inStack = []
+        self.outStack = []
+
+    def push(self, x: int) -> None:
+        self.inStack.append(x)
+
+    def pop(self) -> int:
+        self.peek()
+        return self.outStack.pop()
+
+    def peek(self) -> int:
+        if not self.outStack:
+            while self.inStack:
+                self.outStack.append(self.inStack.pop())
+        return self.outStack[-1]
+
+    def empty(self) -> bool:
+        return not self.inStack and not self.outStack
+
+# Your MyQueue object will be instantiated and called as such:
+# obj = MyQueue()
+# obj.push(x)
+# param_2 = obj.pop()
+# param_3 = obj.peek()
+# param_4 = obj.empty()
+
+# Time complexity:
+# push	O(1)
+# pop	O(1)
+# peek	O(1)
+# empty	O(1)
+
+# Space Complexity:
+# O(n)