Problem · Array
Search in a Rotated Sorted Array
Problem statement
Given an integer array nums that was sorted in strictly increasing order and then rotated at an unknown pivot, and an integer target, return the index of target.
Return -1 when target does not appear in nums.
The problem statement continues
ProExamples
Example 1
nums = [4,5,6,7,0,1,2]target = 0return = 4The target 0 appears at index 4.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week