chore: Fix failing tests

Author: CaedenPH

Diff for: other/number_container_system.py

@@ -1,6 +1,6 @@
 """
-A number container system that uses binary search to 
-delete and insert values into arrays with O(n logn) 
+A number container system that uses binary search to
+delete and insert values into arrays with O(n logn)
 write times and O(1) read times.
 
 This container system holds integers at indexes.
@@ -11,7 +11,7 @@
 
 
 class NumberContainer:
-    def __init__(self):
+    def __init__(self) -> None:
         # Holds number as the key and returns list of indexes where the number is
         # The list of indexes is a sorted array in ascending order
         self.numbermap: dict[int, list[int]] = {}
@@ -42,13 +42,15 @@ def binary_search_delete(self, array: list[int], item: int) -> list[int]:
                 low = mid + 1
             else:
                 high = mid - 1
-        raise ValueError("The item is not in the array, and therefore cannot be deleted")
+        raise ValueError(
+            "The item is not in the array, and therefore cannot be deleted"
+        )
 
     def binary_search_insert(self, array: list[int], index: int) -> list[int]:
         """
         Inserts the index into the sorted array
         at the correct position
-        
+
         >>> NumberContainer().binary_search_insert([1,2,3], 2)
         [1, 2, 2, 3]
         >>> NumberContainer().binary_search_insert([0,1,3], 2)
@@ -60,7 +62,8 @@ def binary_search_insert(self, array: list[int], index: int) -> list[int]:
         while low <= high:
             mid = (low + high) // 2
             if array[mid] == index:
-                # If the item already exists in the array, insert it after the existing item
+                # If the item already exists in the array,
+                # insert it after the existing item
                 array.insert(mid + 1, index)
                 return array
             elif array[mid] < index:
@@ -93,7 +96,7 @@ def change(self, index: int, number: int) -> None:
         self.indexmap[index] = number
 
         # Number not seen before or empty so insert number value
-        if not number in self.numbermap:
+        if number not in self.numbermap:
             self.numbermap[number] = [index]
 
         # Here we need to perform a binary search insertion in order to insert
@@ -121,7 +124,8 @@ def find(self, number: int) -> int:
         """
         # Simply return the 0th index (smallest) of the indexes found (or -1)
         return self.numbermap.get(number, [-1])[0]
-    
+
+
 if __name__ == "__main__":
     import doctest