fix: binary search first occurrence and resolve global ruff linting e…

…rrors
TheAlgorithms · tusharynayaka · Mar 3, 2026 · Mar 3, 2026 · Mar 3, 2026 · Mar 3, 2026
commit 9fe6d31c1b9dbd265f88ca62d240645325435137
diff --git a/data_structures/hashing/hash_table_with_linked_list.py b/data_structures/hashing/hash_table_with_linked_list.py
@@ -8,7 +8,7 @@
         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]
 

diff --git a/searches/jump_search.py b/searches/jump_search.py
@@ -20,7 +20,7 @@
 T = TypeVar("T", bound=Comparable)
 
 
-def jump_search[T](arr: Sequence[T], item: T) -> int:
+def jump_search(arr: Sequence[T], item: T) -> int:
     """
     Python implementation of the jump search algorithm.
     Return the index if the `item` is found, otherwise return -1.