Leetcode 33. Search in Rotated Sorted Array

Given an ascending array of distinct integers that has been rotated at an unknown pivot, return the index of a target value (or -1 if absent) using an O(log n) search that accounts for the rotation.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid July, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 33. Search in Rotated Sorted Array

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact