A sorted array of distinct integers has been rotated at an unknown pivot, for example [4, 5, 6, 7, 0, 1, 2]. Return the minimum element in O(log n) time using binary search.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.