Leetcode – 33. Search In Rotated Sorted Array

This is straight up Binary Search problem with some modifications. When we find the mid point of the given array, one of two things will hold true: The array from start to mid is sorted. The array from mid to end is sorted. Once we know which is the sorted half, all we have to do is check if the …

Mohit AthwaniLeetcode – 33. Search In Rotated Sorted Array