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

Solution: Employee Free Time

Explore how to identify common free intervals across multiple employee schedules by merging their sorted, non-overlapping intervals. Learn to apply min-heap data structures for efficient interval processing, and understand the step-by-step algorithm to calculate free times between meetings globally. This lesson guides you through the logic to find gaps, analyze complexity, and implement the solution in Go.

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