Caught me off guard when the interviewer asked about searching in a rotated sorted array. Just a few days before, I had literally seen this exact problem on prachub.com while prepping.

The process kicked off with a recruiter screen followed by a technical phone interview. They tested my skills with DSA questions and a behavioral round that focused on teamwork.

It felt like a solid experience overall, and I was thrilled to receive an offer. However, I decided to decline in the end, as the timing wasn't right for me.

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4, 5, 6, 7, 0, 1, 2]). Search for a target value and return its index, or -1 if not found.

Required time complexity: O(log n).