Learn and practice the Merge Intervals and K-way Merge patterns to solve coding interview problems.

Educative-99 in Python: Accelerate Your Coding Interview Prep

Many information processing and decision-support problems require us to merge information coming from multiple sources to build up a global picture of a situation before making some business decisions. This module will help us understand and deploy two common coding patterns used to merge lists of structurally homogeneous data to solve hard problems that we encounter, for example, in scheduling, social media applications, and I/O algorithms.

Fusion

# 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$, where `interval` is any interval in the list of schedules.

# Examples


Try to solve the Employee Free Time problem.