Topic: Greedy Algorithm Problem / Level: intermediate

Problem: You are given a set of events, each with a start and end time. Maximize the number of events that can be attended without overlap.

Run the code to see the output here...