Add Python solutions for Search Insert Position and Search Range

Author: avimishraa

data_structures/Binary search algo/first_and_last_positon_sorted_array.py

@@ -0,0 +1,26 @@
+def searchRange(nums, target):
+    def find_bound(is_first):
+        left, right = 0, len(nums) - 1
+        bound = -1
+        while left <= right:
+            mid = (left + right) // 2
+            if nums[mid] == target:
+                bound = mid
+                if is_first:
+                    right = mid - 1
+                else:
+                    left = mid + 1
+            elif nums[mid] < target:
+                left = mid + 1
+            else:
+                right = mid - 1
+        return bound
+
+    first = find_bound(True)
+    last = find_bound(False)
+    return [first, last]
+
+# Test
+nums = [5, 7, 7, 8, 8, 10]
+target = 8
+print("Output:", searchRange(nums, target))

data_structures/Binary search algo/search_insert_position.py

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