Grokking the Coding Interview Patterns in JavaScript/

...

/

Find Minimum in Rotated Sorted Array

Find Minimum in Rotated Sorted Array

Try to solve the Find Minimum in Rotated Sorted Array problem.

We'll cover the following...

Statement

You’re given a rotated sorted array, arr, of length nn, that is rotated clockwise between 11 and nn times.

For example,

  • Before rotation, arr =[1,2,3,4,5,6,7,8]= [1,2,3,4,5,6,7,8]

  • After 33 rotations, the array becomes [6,7,8,1,2,3,4,5][6,7,8,1,2,3,4,5] ...