How should I practice Search a Rotated Sorted Array?

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

Is Search a Rotated Sorted Array associated with NVIDIA?

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

NVIDIA● MediumNEW GRADPHONE SCREEN

An integer array nums has distinct values. It was sorted in strictly increasing order, then possibly rotated without changing the circular order.

Return the zero-based index of target, or -1 when it is absent. The array may also remain in its original sorted order.

search(nums: int[], target: int) → int

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

The target occurs at zero-based index 4.

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

The target does not occur in either sorted segment.

nums = [1]target = 0return = -1

The only value differs from the target.