You’re given a list containing the schedules of multiple employees. Each person’s schedule is a list of non-overlapping intervals in sorted order. An interval is specified with the start and end time, both being positive integers. Your task is to find the list of finite intervals representing the free time for all the employees.

Note: The common free intervals are calculated between the earliest start time and the latest end time of all meetings across all employees.

Constraints:

• $1 \leq$ schedule.length , schedule[i].length $\leq 50$

• $0 \leq$ interval.start < interval.end $\leq 10^8$, where interval is any interval in the list of schedules.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in main.py in the following coding playground. We have provided the definition of the Interval class in the other file. You may add functionality to this class if you wish.