Coding (Algo)

Find the Longest Range Within Budget

Algorithm: Prefix sum Difficulty: Hard Time: 45 minutes

Goal

Return the greatest length of a non-empty contiguous segment whose signed sum is at most target or zero when no segment qualifies.

What this task practices

Find the Longest Range Within Budget is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as hard difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.