All challenges
Algorithm challenge · DSA
Search in Rotated Sorted Array
Difficulty
medium
Time
~25m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#binary-search#arrays
Mission file // read carefullymedium
An ascending array of distinct integers is rotated at an unknown pivot. Given nums and target, return its index, or -1. Aim for O(log n).
nums = [4,5,6,7,0,1,2], target = 0 => 4
Build with
search(nums: int[], target: int) → intPythonJavaScriptTypeScriptGoJavaC++Rust
4 tests · 1 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.