Count Subarrays with a Given Sum
Asked at Waymo · Coding Questions · Difficulty: Medium · Last asked May 13, 2026
Given a list of integers (which may be negative) and a target `k`, count how many contiguous subarrays have a sum exactly equal to `k`. Subarrays that occupy different positions are counted separately, even when their elements are equal.
Loading the problem…
More Waymo interview questions
- ML System Design: Choose Passenger Drop-off Location
- ML Coding: Debug a NumPy / Tensor Framework
- L5+ Behavioral: Policy vs Efficiency Trade-offs & Leadership
- Project Deep-Dive + ML Fundamentals Discussion
- Pickup Request Scheduler (OO Design)
- Build an Arithmetic Expression to Reach a Target