fix: binary search first occurrence and resolve global ruff linting errors

Author: tusharynayaka

data_structures/hashing/hash_table_with_linked_list.py

@@ -8,7 +8,7 @@ def __init__(self, *args, **kwargs):
         super().__init__(*args, **kwargs)
 
     def _set_value(self, key, data):
-        self.values[key] = deque([]) if self.values[key] is None else self.values[key]
+        self.values[key] = deque() if self.values[key] is None else self.values[key]
         self.values[key].appendleft(data)
         self._keys[key] = self.values[key]
 

searches/binary_search.py

@@ -276,4 +276,4 @@ def exponential_search(sorted_collection: list[int], item: int) -> int:
             timeit.timeit(
                 f"{name}(collection, 500)", setup=setup, number=5_000, globals=globals()
             ),
-        )
+        )

searches/jump_search.py

@@ -20,7 +20,7 @@ def __lt__(self, other: Any, /) -> bool: ...
 T = TypeVar("T", bound=Comparable)
 
 
-def jump_search(arr: Sequence[T], item: T) -> int:
+def jump_search[T](arr: Sequence[T], item: T) -> int:
     """
     Python implementation of the jump search algorithm.
     Return the index if the `item` is found, otherwise return -1.