Common Slot Finder

Problem Statement:

You are responsible for developing a scheduling tool that finds common free time slots for meetings. Each employee has a daily schedule defined by:

• A list of non-overlapping time intervals during which they are busy. Each interval is represented by its start and end times (in minutes since the start of the day).

• A working hours interval that defines the inclusive bounds (start and end time) during which meetings can be scheduled.

Given the schedules and working hours of multiple employees and a meeting duration (in minutes), write a function that returns all common time intervals (within the employees’ working hours) during which a meeting of the given duration can be scheduled. The result should be a list of intervals represented similarly by start and end times.

Constraints:

• Assume time is represented in minutes from 0 to 1440 (i.e., 0 representing 12:00 AM and 1440 representing the next day’s 12:00 AM).

• The busy intervals for each employee do not overlap and are sorted by start time.

• The working hours interval for an employee may start before or after some busy intervals. Only intersections between the common free time and the working hours should be considered.

• If no common slot exists that satisfies the meeting duration, return an empty list.

Input:

• An array (or list) of employee schedules. Each employee schedule is an object (or structure) with two properties: one for the list of busy intervals and one for the working hours interval.

• A meeting duration (in minutes).

Output:

• A list of time intervals where all employees are available for at least the given meeting duration.

Your solution should be efficient and well-structured. Write code in the programming language of your choice.