def search_rotated(nums: list[int], target: int) -> int:
    left, right = 0, len(nums) - 1

    while left <= right:
        mid = left + (right - left) // 2

        if nums[mid] == target:
            return mid

        # left half is sorted
        if nums[left] <= nums[mid]:
            if nums[left] <= target < nums[mid]:
                right = mid - 1
            else:
                left = mid + 1
        # right half is sorted
        else:
            if nums[mid] < target <= nums[right]:
                left = mid + 1
            else:
                right = mid - 1

    return -1

# Time: O(log n), Space: O(1)
# [4,5,6,7,0,1,2], target=0 -> 4
# [4,5,6,7,0,1,2], target=3 -> -1

Binary Search — Beyond Sorted Arrays

Binary Search — Beyond Sorted Arrays

Binary Search — Beyond Sorted Arrays