Search rotated sorted array
Your task
A sorted ascending array of DISTINCT integers was rotated at an unknown pivot. Given the rotated array nums and a target, return the index of target, or -1 if absent. You must do it in O(log n) time. Constraints: 1 <= len(nums) <= 5000, -10^4 <= nums[i], target <= 10^4.
Examples
search_rotated(nums: list[int], target: int) -> intExample 1
Input
search_rotated([4, 5, 6, 7, 0, 1, 2], 0)Output
4