Question
A workout scheduler lists back-to-back session energy costs as positive integers. A athlete wants the longest run of consecutive sessions whose total cost stays within a daily budget. Given costs and budget, return the length of the longest qualifying run — 0 if even the cheapest single session exceeds the budget. Example: costs = [3, 1, 2, 5, 1, 1], budget = 6 gives 3 (sessions 3 + 1 + 2).
longest_run_within_budget(costs: list[int], budget: int) → int[[3,1,2,5,1,1],6]out3State 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.