You are given an array of meeting times, intervals, where each interval consists of a pair of start and end times, identify whether or not a person can attend all the meetings.

An important thing to note here is that the specified end time for each meeting is exclusive.

Constraints:

• $0 \leq$ intervals.length $\leq 10^4$

• intervals[i].length $== 2$

• $0 \leq$ $start_{i}$ $<$ $end_{i}$ $\leq 10^6$

So far, you have probably brainstormed some approaches and have an idea of how to solve this problem. Let’s explore some of these approaches and figure out which one to follow based on considerations such as time complexity and any implementation constraints.

The naive approach to solving this problem is to compare each meeting interval with other meetings to check if any two meetings overlap. The meetings overlap with each other if one meeting starts while the other meeting is still in progress. To check this, we have to make sure that the second meeting begins before the first meeting ends. This way, we would get our solution, but the computational cost of achieving this is very high, since we have to compare each meeting with the rest of the meetings. The time complexity of this approach will be $O(n^2)$. Let's try to devise an optimized approach to solve this problem.

An optimized approach to solve this problem is to use the merge intervals technique. In this approach, we will sort the given meeting intervals in ascending order with respect to their start time. After this, we will iterate over these sorted intervals and check if any two consecutive meetings overlap with each other. To do this, we compare the end time of the first meeting with the start time of the second meeting. If the start time is less than the end time, we would simply return FALSE, meaning a person cannot attend all the given meetings. Otherwise, we keep checking all the intervals and return TRUE if no clash occurs between any two meetings.

Let's look at the illustration below to better understand the solution.