Today’s article will cover and explain the optimal solution to Leetcode 153 — Find Minimum in Rotated Sorted Array. Problem Overview Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums=[0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. …