Solution: Employee Free Time
Explore how to identify the free time shared by multiple employees by merging their sorted, non-overlapping intervals. Understand how to use a min-heap to efficiently process intervals and detect gaps to return a list of available free time, optimizing the solution for large schedules.
We'll cover the following...
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:
-
schedule.length,schedule[i].length -
interval.start<interval.end...