NewProject Coding is here — build features and fix bugs in real codebases with an AI assistantSee what's new

(This question is a variation of the LeetCode question 759. Employee Free Time. If you haven't completed that question yet, it is recommended to solve it first.)

You are building a meeting scheduler. You are given an array of strings, events, and an integer k representing a required meeting duration in minutes. Each string in events represents a person's busy schedule in the format "<person_name> <action> <start_time> <end_time>".

Your goal is to find the earliest possible time slot of at least k minutes within a single day (from "00:00" to "23:59") when all unique individuals are available. The busy period defined by <start_time> and <end_time> is inclusive.

Test Cases
Input
Output
Expected