Solution: Search in Rotated Sorted Array
Let's solve the Search in Rotated Sorted Array problem using the Modified Binary Search pattern.
Statement
Given a sorted integer array, nums
, and an integer value, target
, the array is rotated by some arbitrary number. Search and return the index of target
in this array. If the target
does not exist, return -.
An original sorted array before rotation is given below:
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.