Algorithm · Citadel · Medium
You are designing a meeting scheduler. You receive a list of strings events and an integer k representing the required meeting length in minutes. Every string in events describes one person's blocked-off time using the pattern " ". Your task is to identify the earliest time window of at least k minutes within a single day (spanning "00:00" to "23:59") during which every distinct person is free. A busy interval runs from up to and including . Return the start of this window…
Checking your access…