You are given two lists of availability time intervals, slots1 and slots2, where each interval is represented as [start, end]. You are also given an integer duration representing the required length of a meeting.

Return the earliest time interval [meetingStart, meetingEnd] such that:
the meeting fits entirely within an interval from slots1 and within an interval from slots2, and meetingEnd - meetingStart = duration.

If no such time interval exists, return an empty list.

Constraints:

• $1 \leq$ slots1.length, slots2.length $\leq 10^4$

• slots1[i].length $=$ $2$ and slots2[i].length $=$ $2$

• slots1[i][0] $<$ slots1[i][1]

• slots2[i][0] $<$ slots2[i][1]

• $0 \leq$ slots1[i][j], slots2[i][j] $\leq 10^9$

• $1 \leq$ duration $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.