solulubeta
Sign in
NeetCode 150 / Binary Search
05.05 · Problem

Search in Rotated Sorted Array

Medium Binary search: one half is always sorted 1 video LC 33 Pro

This problem is part of solulu Pro

A sorted array of distinct integers has been rotated at an unknown pivot ([0,1,2,4,5,6,7] → [4,5,6,7,0,1,2]). Return the index of target, or -1, in O(log n).

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 32 of 150 · updated 2026-10-12