Algorithm · Rippling · Medium
Given the online availability windows for a group of delivery drivers, determine the highest number of drivers who were online at the same time within the previous 24 hours. Input: A list of sublists, with each sublist holding two timestamps in HH:MM format: the time a driver came online and the time that driver went offline. Output: Return an integer equal to the greatest number of drivers online concurrently during the last 24 hours. Constraints: If one driver's end time…
Checking your access…