Topic: Greedy Algorithm Problem / Level: beginner

Problem: Given a set of activities with their start and end times, find the maximum number of activities that can be performed.

Run the code to see the output here...