How should I practice Earliest Longest Bounded-Adjacent Subarray?

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

Is Earliest Longest Bounded-Adjacent Subarray associated with ZipRecruiter?

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

Earliest Longest Bounded-Adjacent Subarray

ZipRecruiter● EasyFULLTIMENEW GRADOA

Learn

Problem statement

A contiguous subarray qualifies when every adjacent absolute difference is at most difference.

Return inclusive [start,end] indices of a maximum-length qualifying subarray, breaking ties by earliest start.

Function

longestBoundedAdjacentSubarray(numbers: int[], difference: int) → int[]

Examples

Example 1

numbers = [-1,4,6,2,8,4,7]difference = 5return = [0,3]

The earliest maximum qualifying run is returned.

Example 2

numbers = [1,10,2,11]difference = 3return = [0,0]