Search⌘ K
AI Features

Search in Rotated Sorted Array

Understand how to locate the index of a target in a rotated sorted array with unique values. Learn to apply modified binary search to handle rotations and improve search efficiency.

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