MediumNo. 0153

Find Minimum in Rotated Sorted Array — LeetCode 153 Python Solution

Topics
Array, Binary Search
Reading time
2 min

The problem

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.

Example

Input
nums = [3,4,5,1,2]
Output
1
Explanation
The original array was [1,2,3,4,5] rotated 3 times.

Python solution

PythonSolution
class Solution:
    def findMin(self, nums: List[int]) -> int:
        if nums[0] <= nums[-1]:
            return nums[0]
        left, right = 0, len(nums) - 1
        while left < right:
            mid = (left + right) >> 1
            if nums[0] <= nums[mid]:
                left = mid + 1
            else:
                right = mid
        return nums[left]

Complexity

Time
O(log n) or O(n log n)
Space · auxiliary
O(1)

Pattern: Monotonic Stack

Answer "what is the next greater element" for every position in one pass. LeetCode 153. Find Minimum in Rotated Sorted Array is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The monotonic stack guide has the Python template for the pattern and the 225 LeetCode problems that use it.

Related problems

Frequently asked questions

How hard is LeetCode 153. Find Minimum in Rotated Sorted Array?

LeetCode 153. Find Minimum in Rotated Sorted Array is rated Medium on LeetCode.

What topics does LeetCode 153. Find Minimum in Rotated Sorted Array cover?

LeetCode 153. Find Minimum in Rotated Sorted Array is tagged Array and Binary Search on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.