Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

Search in rotated sorted array challenge

Sharing is caring!

Problem statement
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., \left[0, 1, 2, 4, 5, 6, 7\right] might become \left[4, 5, 6, 7, 0, 1, 2\right]).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.