DIY: Search in Rotated Sorted Array
We'll cover the following
Problem statement
Search for a given number in a sorted array of unique elements that have been rotated an arbitrary number. Assume that an array is rotated at some point unknown to you beforehand (For example, [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2] ...
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Devpath's Terms of Service and Privacy Policy