Search rotated sorted array
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.
Implement
search_rotated(nums: list[int], target: int) → intExamples
in
[[4,5,6,7,0,1,2],0]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[4,5,6,7,0,1,2],0]4not run yetsample