Topic: Greedy Algorithm Problem / Level: beginner

Problem: You are given a set of jobs with deadlines and profits. Maximize the total profit by scheduling non-overlapping jobs.

Run the code to see the output here...