Topic: Greedy Algorithm Problem / Level: beginner

Problem: You are given a set of jobs with deadlines and profits. Find the maximum profit that can be earned by scheduling non-overlapping jobs.

Run the code to see the output here...