Your question is Deadline Scheduling Algorithm. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
A Thales TopSky mission-planning component has a set of available tasks. Each task requires exclusive processor time, has a completion deadline, and provides value only if completed by that deadline. Tasks are non-preemptive, all are available at time 0, and at most one task can run at a time.
Return the IDs of a subset of tasks that maximizes total value. The returned IDs must be in a valid execution order. If multiple optimal schedules exist, any one is acceptable.
Implement schedule_tasks(tasks), where tasks is a list of dictionaries. Each dictionary contains:
id: a unique stringduration: a positive integerdeadline: a positive integervalue: a non-negative integerReturn a list of task IDs. A selected task is valid only when its cumulative completion time is at most its deadline. Tasks that cannot be completed by their deadlines may be omitted.
def schedule_tasks(tasks):