[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/first_and_last_positon_sorted_array.py

@@ -20,6 +20,7 @@ def find_bound(is_first):
     last = find_bound(False)
     return [first, last]
 
+
 # Test
 nums = [5, 7, 7, 8, 8, 10]
 target = 8

data_structures/Binary search algo/search_insert_position.py

@@ -1,6 +1,6 @@
 def searchInsert(nums, target):
     left, right = 0, len(nums) - 1
-    
+
     while left <= right:
         mid = (left + right) // 2
         if nums[mid] == target:
@@ -11,6 +11,7 @@ def searchInsert(nums, target):
             right = mid - 1
     return left  # insertion point
 
+
 # Test
 nums = [1, 3, 5, 6]
 target = 5