Code RoomMaximum tasks in budget
EasyPrep Room Coding #640

Maximum tasks in budget

CodingAlgorithms & data structuresEntry–Mid~10 min

You are given a list of task durations in minutes and a total time budget. You work on one task at a time, in any order you like, and a task only counts if you finish it completely. Return the maximum number of tasks you can complete without the combined time exceeding the budget. Example: durations [30, 10, 20, 45] with budget 60 gives 3 (do the 10, 20, and 30 minute tasks).

Implement
max_completed_tasks(durations: list[int], budget: int) → int
Examples
in[[30,10,20,45],60]out3
What 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 10 min
InputExpectedGot
[[30,10,20,45],60]3not run yetsample