| 1 | """ |
| 2 | Given a list of tasks, each with a deadline and reward, calculate which tasks can be |
| 3 | completed to yield the maximum reward. Each task takes one unit of time to complete, |
| 4 | and we can only work on one task at a time. Once a task has passed its deadline, it |
nothing calls this directly
no test coverage detected