Grokking the Coding Interview Patterns/

...

/

Solution: Find Minimum in Rotated Sorted Array II

Solution: Find Minimum in Rotated Sorted Array II

Let’s solve the Find Minimum in Rotated Sorted Array II using the Modified Binary Search pattern.

We'll cover the following...

Statement

Imagine you have an array, nums, of length nn that was originally sorted in non-decreasing (ascending) order. This array has been rotated between 11 and nn times. For example, the sorted array [0,2,3,3,5,7,11][0,2,3,3,5,7,11] can become:

  • [5,7,11,0,2,3,3][5,7,11,0,2,3,3] ...