Solution: Employee Free Time

Explore how to find shared free time among employees by merging their non-overlapping schedule intervals. Understand using a min-heap to efficiently process start times, identify gaps between intervals, and generate a list of common free periods. Gain insight into the logic and complexity of the algorithm to solve overlapping interval problems in practical contexts.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

You’re given a list containing the schedules of multiple employees. Each person’s schedule is a list of non-overlapping intervals in a 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$ ...