35-SearchInsertPosition

Search Insert Position

Problem can be found in here!

Solution: Binary Search

def searchInsert(nums: List[int], target: int) -> int:
    left, right = 0, len(nums)

    while left < right:
        mid = (left + right) // 2
        if nums[mid] == target:
            return mid
        elif nums[mid] <= target:
            left = mid + 1
        else:
            right = mid

    return left

Time Complexity: , Space Complexity: