How should I practice Left Rotation to a Strictly Increasing Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related ZipRecruiter online assessment problems in FastPrep.

Is Left Rotation to a Strictly Increasing Array associated with ZipRecruiter?

FastPrep tags this as a ZipRecruiter online assessment coding practice problem when the problem catalog has that company and stage context.

Left Rotation to a Strictly Increasing Array

ZipRecruiter● EasyNEW GRADOA

Learn

Problem statement

Given a nonempty integer array numbers, return how many cyclic left shifts make it strictly increasing.

If no cyclic left rotation works, return -1. Return the unique valid shift when one exists.

Function

rotationToIncreasing(numbers: int[]) → int

Examples

Example 1

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

Rotating left by three produces [1,2,3,4,5].

Example 2

numbers = [1,2,3]return = 0

The array is already strictly increasing.

Constraints

1 <= numbers.length <= 100000