[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/Binary search algo/search_insert_position.py

@@ -1,5 +1,6 @@
 from typing import List
 
+
 def search_insert(nums: List[int], target: int) -> int:
     """
     Finds the index to insert a target value into a sorted list.
@@ -24,4 +25,4 @@ def search_insert(nums: List[int], target: int) -> int:
             left = mid + 1
         else:
             right = mid - 1
-    return left
+    return left

data_structures/Binary search algo/search_range.py

@@ -1,5 +1,6 @@
 from typing import List
 
+
 def search_range(nums: List[int], target: int) -> List[int]:
     """
     Finds the first and last position of a given target value in a sorted array.
@@ -36,4 +37,4 @@ def find_bound(is_first: bool) -> int:
         return [-1, -1]
 
     last_bound = find_bound(False)
-    return [first_bound, last_bound]
+    return [first_bound, last_bound]