Binary Search in Rotated Array | Dataford Interview Questions

Describe how you would use binary search in a rotated sorted array. Implement search_rotated(nums, target), returning the index of target or -1 if it is absent. Assume nums contains distinct integers and was formed by rotating an ascending array; aim for O(log n) time and O(1) extra space.

Constraints

1 <= nums.length <= 9999
-10^9 <= nums[i], target <= 10^9
All values in nums are distinct
nums is an ascending array rotated zero or more positions

Function Signature

def search_rotated(nums, target):

Your question is Binary Search in Rotated Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= nums.length <= 9999
-10^9 <= nums[i], target <= 10^9
All values in nums are distinct
nums is an ascending array rotated zero or more positions

Function Signature

def search_rotated(nums, target):

Your question is Binary Search in Rotated Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.