Company: Atlassian_31july
Difficulty: medium
Earliest Meeting Time Problem Description A meeting assistant keeps a diary of everything the office is busy with. Each diary entry names one person, what that person is doing, and the window of the day the activity covers. Everyone who appears anywhere in the diary is invited, so the meeting can only run during minutes that are free for every one of them. Given the diary and a meeting length k in minutes, find the earliest time of day at which a meeting of k consecutive minutes can begin. If no such time exists, report -1 . Input Format The first line contains a single integer n , the number of event descriptors. Each of the next n lines contains one descriptor in the form <person name> <event name> <start time> <end time> , where both times are written in 24-hour HH:MM form. The last line contains a single integer k , the meeting duration in minutes. Output Format Print a single line holding the earliest possible meeting start time in HH:MM form, using two dig