Phone screening that started late because the interviewer was late.

I don't understand why companies have an incentive to always put the worst people for interviewing.

Anyways, the coding question was LeetCode medium, but if you haven't seen the question before, you will struggle with the edge cases.

Google Calendar, Outlook, and iCal have been banned from your company. So, an intrepid engineer has decided to roll their own implementation. Unfortunately, one major missing feature is the ability to find out what time slots are free for a particular individual.

Given a list of time blocks where a particular person is already booked/busy, a start and end time to search between, and a minimum duration to search for, find all the blocks of time that a person is free for a potential meeting that will last the aforementioned duration.

Given:

• start_time
• end_time
• duration
• meetings_list

-> suggested_meeting_times

Let's assume we abstract the representation of times as simple integers, so a valid time is any valid integer supported by your environment. Here is an example input:

meetings_list: [3,20], [-2, 0], [0,2], [16,17], [19,23], [30,40], [27, 33]

start_time: -5

end_time: 27

min_duration: 2

Expected answer:

free_time: [-5, -2], [23,27]