Longest budget run

Write codeMedium14 min

Your task

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).

Examples

longest_run_within_budget(costs: list[int], budget: int) -> int

Example 1

Inputlongest_run_within_budget([3, 1, 2, 5, 1, 1], 6)

Output3