Meeting Scheduling Problem

Description

Given a list of event strings events[n] and an integer k representing the duration of a meeting in minutes, find the earliest possible start time in "HH:MM" format when all people mentioned in the events are free for at least k minutes. If no such time exists, return "-5".

Each event has the format:
"<name> <action> <start_time> <end_time>"
Example: "Taylor sleep 00:00 08:00"

Input

• events[n]: List of strings describing events
• k: Integer, minimum duration in minutes for the meeting

Output

• A string representing the earliest possible start time in "HH:MM" format
• Return "-5" if no such time is found

Input Example

events = [
  "Taylor sleep 00:00 08:00",
  "Alex work 09:00 12:00",
  "Taylor meeting 14:00 15:00",
  "Alex call 13:00 14:30"
]
k = 60

Output Example

15:00

我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。

We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.