Count subarrays within budget
A marketing team logs its daily ad spend as non-negative integers. For budget planning they ask: how many contiguous runs of days (non-empty, any length) have total spend at most `budget`? Overlapping runs count separately. Since spend is never negative, growing a run can never decrease its total — use that. Example: spend = [2, 1, 3], budget = 3 gives 4: the runs are [2], [1], [3], and [2, 1].
Implement
count_affordable_runs(spend: list[int], budget: int) → intExamples
in
[[2,1,3],3]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 16 min
solution.py
InputExpectedGot
[[2,1,3],3]4not run yetsample