How should I practice Find Minimum in a Rotated Sorted Array?

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

Is Find Minimum in a Rotated Sorted Array associated with Point72?

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

Problem · Array

● Medium

Point72FULLTIMEPHONE SCREEN

Return the minimum element of nums, which was formed by rotating a strictly increasing array.

findMin(nums: int[]) → int

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

The rotation point begins at one.

nums = [4,5,6,7,0,1,2]return = 0

Zero is the first value after the pivot.