Topic: Greedy Algorithm Problem / Level: intermediate

Problem: You are given a list of tasks with start and end times. Assign the tasks to workers such that the total number of tasks completed is maximized without overlap.

Run the code to see the output here...