Add missing type annotations

Author: orfeasa

01. Arrays/01-01 Anagram Check/anagram.py

@@ -1,3 +1,6 @@
+from typing import Dict
+
+
 # Cheating
 def anagram2(s1: str, s2: str) -> bool:
     string1 = "".join(sorted(s1.lower())).strip()
@@ -11,7 +14,7 @@ def anagram(s1: str, s2: str) -> bool:
     s2 = s2.lower().replace(" ", "")
 
     # create map of characters in first string
-    char_map = {}
+    char_map: Dict[str, int] = {}
 
     for char in s1:
         char_map.setdefault(char, 0)

01. Arrays/01-03 Find the Missing Element/finder.py

@@ -28,4 +28,3 @@ def finder2(arr1, arr2):
         result ^= num
 
     return result
-

02. Stacks, Queues and Deques/02-01 Implement a Stack/stack.py

@@ -1,9 +1,9 @@
-from typing import Any
+from typing import Any, List
 
 
 class Stack(object):
     def __init__(self) -> None:
-        self.items = []
+        self.items: List[Any] = []
 
     def push(self, item: Any) -> None:
         # Push a new item

02. Stacks, Queues and Deques/02-02 Implement a Queue/queue.py

@@ -1,9 +1,9 @@
-from typing import Any
+from typing import Any, List
 
 
 class Queue(object):
-    def __init__(self):
-        self.items = []
+    def __init__(self) -> None:
+        self.items: List[Any] = []
 
     def size(self) -> int:
         # Returns the size of the Queue

02. Stacks, Queues and Deques/02-03 Implement a Deque/deque.py

@@ -1,9 +1,9 @@
-from typing import Any
+from typing import Any, List
 
 
 class Deque(object):
     def __init__(self) -> None:
-        self.items = []
+        self.items: List[Any] = []
 
     def size(self) -> int:
         # Checks the Size

02. Stacks, Queues and Deques/02-05 Implement a Queue Using Two Stacks/queue_2_stacks.py

@@ -1,18 +1,18 @@
-from typing import Any
+from typing import Any, List
 
 
 class Queue2Stacks(object):
     def __init__(self) -> None:
-        self.inbox = []
-        self.outbox = []
+        self.inbox: List[Any] = []
+        self.outbox: List[Any] = []
 
     def enqueue(self, element: Any) -> None:
         # push new element onto inbox
         self.inbox.append(element)
 
     def dequeue(self) -> Any:
-        # If outbox is empty, refill it by popping each element from inbox and pushing it
-        # onto outbox. Pop and return the top element from outbox
+        # If outbox is empty, refill it by popping each element from inbox and
+        # pushing it onto outbox. Pop and return the top element from outbox
         if len(self.outbox) == 0:
             while len(self.inbox) != 0:
                 self.outbox.append(self.inbox.pop())