Busiest Office Period

You are given an array of records representing employee presence in an office for a single day. Each record is an object containing two properties:

• checkIn: a string representing the time the employee checked in (format: HH:MM, 24-hour clock).
• checkOut: a string representing the time the employee checked out (format: HH:MM, 24-hour clock).

It is guaranteed that for each record, the check-in time is strictly earlier than the check-out time.

Your task is to determine the contiguous time interval during which the office had the maximum number of employees present. If the maximum occupancy is maintained over multiple intervals, return the earliest such interval.

Input:

An array of objects, for example:

[
  { "checkIn": "09:00", "checkOut": "11:30" },
  { "checkIn": "10:15", "checkOut": "12:00" },
  { "checkIn": "10:45", "checkOut": "11:00" }
]

Output:

Return an object with the following properties:

• start: the start time (HH:MM) of the interval with the maximum occupancy.
• end: the end time (HH:MM) of that interval.
• count: the maximum number of employees present during that interval.

Example:

Given the input above, the maximum occupancy is 3, which occurs from 10:45 to 11:00. Thus, your function should return:

{ "start": "10:45", "end": "11:00", "count": 3 }

Constraints & Considerations:

• Be sure to handle cases where multiple events (check-ins or check-outs) occur at the same time.
• The solution should account for efficiency as the number of records may be large.
• You may assume all the times are on the same day and valid.
• The returned interval should be as long as possible where the occupancy stays at the maximum value continuously.

Write a function or program in your preferred language to solve this problem.