Solution: Search in Rotated Sorted Array
Explore how to find a target element within a rotated sorted array by applying a modified binary search technique. This lesson guides you through dividing the array and narrowing the search space effectively, enhancing your problem-solving skills for coding interviews.
Statement
You are given a sorted integer array, nums, and an integer, target. The array may have been rotated by an arbitrary number. Your task is to find and return the index of target in this array. If target does not exist, return -1.
An original sorted array before rotation is given below:
After rotating this array 6 times, it changes to:
Constraints:
- All values in
numsare unique. - The values in
numsare sorted in ascending order. - The array may have been rotated by some arbitrary number.
-
nums.length -
nums[i] -
target