The Blind 75 Leetcode Series: Find Minimum in Rotated Sorted Array
5 min readSep 26, 2022
Today, we are working on 153. Find Minimum in Rotated Sorted Array
Suppose an array of length
n
sorted in ascending order is rotated between1
andn
times. For example, the arraynums = [0,1,2,4,5,6,7]
might become:
[4,5,6,7,0,1,2]
if it was rotated4
times.
[0,1,2,4,5,6,7]
if it was rotated7
times.