Topic: Greedy Algorithm Problem / Level: intermediate

Problem: You are given a set of tasks with deadlines and profits. Maximize the total profit by scheduling non-overlapping tasks to be completed before their deadlines.

Run the code to see the output here...