Loading…
Search in Rotated Sorted Array is a medium coding interview question covering arrays, binary search — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
A sorted array of distinct integers was rotated at an unknown pivot, e.g. [4,5,6,7,0,1,2]. Given the array and a target, return the target's index or -1. Required: O(log n) time.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.