Skip to main content

Search in Rotated Sorted Array

There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is rotated at an unknown pivot index k. Given the array nums after the rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

Problems35 / 152
Sign in

Search in Rotated Sorted Array

MEDIUMArrayBinary Search

There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is rotated at an unknown pivot index k. Given the array nums after the rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums.

Example 1

Input:  nums = [4,5,6,7,0,1,2], target = 0
Output: 4

Example 2

Input:  nums = [4,5,6,7,0,1,2], target = 3
Output: -1
Show hint

Use modified binary search. Determine which half is sorted, then check if target is in that sorted half. Otherwise search the other half.

Draft saves automatically

Loading editor...

Submit also runs hidden tests
nums =
[4,5,6,7,0,1,2]
target =
0
Expected
4
Run with your own input (JSON)