Topic: Greedy Algorithm Problem / Level: beginner

Problem: Given a set of jobs with start and end times, find the maximum profit that can be obtained by scheduling non-overlapping jobs.

Run the code to see the output here...