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

Solution: Employee Free Time

Explore how to find common free time across multiple employees' schedules by merging their busy intervals using a min-heap. Understand the algorithm's steps to efficiently identify gaps representing free periods and analyze its time and space complexities.

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