Question
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].
count_affordable_runs(spend: list[int], budget: int) → int[[2,1,3],3]out4State 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.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.