solved: 35. Search Insert Position

Signed-off-by: rajput-hemant <[email protected]>

Author: rajput-hemant

src/0001-0100/035 - Search Insert Position/solution.py

@@ -0,0 +1,21 @@
+class Solution:
+    def searchInsert(self, nums: list[int], target: int) -> int:
+        if target in nums:
+            return nums.index(target)
+        else:
+            nums.append(target)
+            nums.sort()
+            return nums.index(target)
+
+        # Using binary search
+        # start = 0
+        # end = len(nums) - 1
+        # while start <= end:
+        #     mid = (start + end) // 2
+        #     if nums[mid] == target:
+        #         return mid
+        #     elif nums[mid] < target:
+        #         start = mid + 1
+        #     else:
+        #         end = mid - 1
+        # return start