Search in Rotated Sorted Array · Coding Interview Practice

Search in Rotated Sorted ArrayA sorted array is rotated at an unknown pivot. Given a target, return its index or -1, running in O(log n) time.Constraints

1 <= nums.length <= 5000

-10^4 <= nums[i], target <= 10^4

All values are unique

Examples

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

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

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…