Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Employee Free Time

Explore how to find common free time intervals across multiple employee schedules by merging overlapping intervals. Understand using a min-heap for efficient processing, track previous interval endpoints, and identify gaps representing free periods. Gain the skills to implement this solution with optimal time and space complexity.

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 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≤1 \leq schedule.length , schedule[i].length ≤50\leq 50

  • 0≤0 \leq interval.start < interval.end ≤108\leq 10^8 ...