Employee Free Time

Explore how to find common free time intervals across multiple employees by merging and intersecting their schedules. Understand how to process lists of non-overlapping intervals and develop an approach to identify shared downtime effectively in a coding interview context.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

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

JavaScript

usercode > Solution.js

import { Interval } from './Interval.js';
import { MinHeap, MaxHeap } from './Heap.js';

/* The following definition is for MinHeap.

  You can use the same methods for MaxHeap.
  class MinHeap {

    size();          // return number of elements
    peek();          // return top element without removing
    push(val);       // insert element
    pop();           // remove and return top element
  }
*/

// The input parameter `schedule` is a list of lists, where each inner
// list contains `Interval` objects representing an employee's schedule.
function employeeFreeTime(schedule){
    
    // Replace this placeholder return statement with your code
    return [new Interval(0, 0), new Interval(0, 0)];
}

export {
    employeeFreeTime
};

Employee Free Time

Employee Free Time

Statement

Examples

Understand the problem

Figure it out!

Try it yourself