Solution: Employee Free Time

Let's solve the Employee Free Time problem using the Merge Intervals pattern.


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.


  • 11 \leq schedule.length , schedule[i].length 50\leq 50

  • 00 \leq interval.start < interval.end 108\leq 10^8, where interval is any interval in the list of schedules.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.