Employee Free Time

Explore how to determine overlapping free time intervals across multiple employee schedules. Learn to merge and evaluate interval objects efficiently to solve scheduling problems typical in coding interviews.

We'll cover the following...

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

Statement

You are given schedule, a list where each element contains the working hours of one employee.

Each employee’s working hours are represented as a list of Interval objects that are already sorted and do not overlap.

Return all finite intervals with non-zero duration during which all employees are simultaneously free. The resulting list of free intervals should also be sorted in ascending order.

Note: The intervals are represented as objects, not arrays. For example, schedule[1][1].start = 1 and schedule[1][1].end = 2, while schedule[0][0][0] is invalid. Do not include intervals with zero length (for example, [3, 3]) in the output.

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