Topic: Greedy Algorithm Problem / Level: beginner

Problem: Given a set of students and exam times, find the maximum number of exams that can be scheduled without conflicts.

Run the code to see the output here...