Search⌘ K
AI Features

Search in Rotated Sorted Array

Explore how to effectively locate a target value in a rotated sorted array by applying modified binary search techniques. This lesson helps you understand problem constraints and develop code that efficiently returns the correct index or indicates absence, preparing you to solve similar interview problems.

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:

g array 1 10 20 47 59 63 75 88 99 107 120 133 155 162 176 188 199 200 210 222
...