arrow_back Back to Challenges

#153 Find Minimum in Rotated Sorted Array

Medium Acceptance 0%
description

Problem Description

Suppose an array of length `n` sorted in ascending order is rotated between 1 and `n` times. Given the sorted rotated array `nums` of unique elements, return the minimum element of this array. You must write an algorithm that runs in O(log n) time.

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Arrays Binary Search

Hiring Companies

Goldman Sachs Netflix
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude