Back to Question
Search in Rotated Sorted Array
Question Explain
Given a sorted array that has been rotated at some pivot, find the index of the `target` value. The algorithm should have $O(\log n)$ runtime complexity.
Start Trying This Question Simulation
Click "Start Speaking" and answer the question naturally.