How should I practice Minimum in a Rotated Sorted Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Mygate phone screen problems in FastPrep.

Is Minimum in a Rotated Sorted Array associated with Mygate?

FastPrep tags this as a Mygate phone screen coding practice problem when the problem catalog has that company and stage context.

Mygate● MediumFULLTIMEPHONE SCREEN

Given a nonempty array nums formed by rotating a strictly increasing integer array, return its minimum element.

Rotating moves a prefix to the end while preserving the order within each part. Zero rotations are allowed. All elements are distinct.

Your solution must use O(log n) time and O(1) extra space.

minimumRotatedArray(nums: int[]) → int

nums = [3,4,5,1,2]return = 1

The increasing sequence [1, 2, 3, 4, 5] was rotated, and its minimum remains 1.

nums = [1,2,3]return = 1

A zero rotation is valid; the first value is the minimum.

nums = [5]return = 5

A singleton has no different minimum.