Solution: Employee Free Time

Explore how to identify common free periods among multiple employees by merging their scheduled intervals using a min-heap. Learn to systematically find gaps between meetings and return free time slots efficiently. This lesson helps you understand interval handling and merging techniques to solve scheduling problems.

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 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$ ...