Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given a set of jobs with start and end times, maximize the number of non-overlapping jobs that can be scheduled.

Run the code to see the output here...