Solution: Search in Rotated Sorted Array
Let's solve the Search in Rotated Sorted Array problem using the Modified Binary Search pattern.
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:
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.