Medium41.3% acceptance
Search in Rotated Sorted Array
Search for a target inside a rotated sorted array in logarithmic time.
Topics
Binary SearchArrays
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
Expected Complexity
O(log n) time and O(1) space.
What happens after Submit?
ERROR DNA analyzes your submission and identifies recurring patterns in your mistakes.
solution.cppC++17
Loading...
C++17