Practice Search in Rotated Sorted Array
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 <= k < nums.length) such that the resulting array is [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]] (0-indexed). For example, [0,1,2,4,5,6,7] might be rotated at pivot index 3 and become [4,5,6,7,0,1,2]. Given the array nums after the possible rotation and an integer target, return the index of target if it is in nums, or -1 if it is not in nums. You must write an algorithm with O(log n) runtime complexity.
Source: Search in Rotated Sorted Array on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [4,5,6,7,0,1,2], target = 0
4
# Example 2
nums = [4,5,6,7,0,1,2], target = 3
-1
# Example 3
nums = [1], target = 0
-1
Constraints
Related LeetCode Problems
Practice more problems similar to Search in Rotated Sorted Array.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.