Search⌘ K
AI Features

Search in Rotated Sorted Array

Explore how to locate a target element in a rotated sorted array using a modified binary search approach. This lesson helps you understand the problem setup, constraints, and step-by-step solution strategy to solve typical coding interview questions involving rotated arrays.

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
...