Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given a set of intervals representing tasks, find the maximum number of non-overlapping tasks that can be scheduled.

Run the code to see the output here...