Your question is Rotated Array Binary Search. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
How do you handle edge cases, such as duplicate elements in a rotated array, when implementing a binary search?