Feature #5: Find Common Meeting Times
Understand how to determine overlapping meetings between two users by analyzing their sorted, non-conflicting schedules. Explore algorithmic techniques to efficiently find common busy times, enhancing your problem-solving skills with real-world scheduling scenarios relevant to coding interviews.
We'll cover the following...
Description
For this feature, we want to implement a feature that lets us see when two users are busy at the same time. We will be given the meeting schedule of two users, and we have to find all the overlapping meetings to determine when both of them are unavailable.
We will also assume that each user’s schedule is free of conflicting meetings, meaning their schedules are non-overlapping. Moreover, the meetings have been already sorted based on their starting time.
Let’s say that we are given the following pairs of meeting schedules: [[1, 3], [5, 6], [7, 9]] and [[2, 3], [5, 7]]. In this example, we can see that both of the users will be busy at the following times: [[2, 3], [5, 6]].
Take a look at the illustration given below:
Note: For simplicity, we are mapping the military timing to integers in the input. So, for example,
8:00will be denoted by8in the code.
Solution
Here is how we will implement this feature:
-
We will use two indices,
iandj, to traverse both of the meeting schedules,meetings_aandmeetings_b, respectively. -
The indices
iandjwill both be zero at the beginning. ...