Coding (Algo)

Count Matching Ranges

Algorithm: Prefix sum Difficulty: Medium Time: 35 minutes

Goal

Implement solve(input) to return the number of non-empty contiguous ranges whose sum equals target. Count ranges by their start and end positions rather than by their values.

What this task practices

Count Matching Ranges 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 medium 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.