Minimum in Rotated Sorted Array

Problem

Find the minimum number in a rotated sorted array of distinct integers.

Examples

Example 1

Input: [3,4,5,1,2]

Output: 1

Example 2

Input: [1,2,3]

Output: 1

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Minimum in Rotated Sorted Array

Find the minimum number in a rotated sorted array of distinct integers. Compare with the rightmost value to locate the rotated portion. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(log n) time and O(1) space.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.