You are given an integer n representing the length of a $0$ indexed range from $0$ to n $- 1$, and a $2 ext{D}$ integer array ranges where ranges[i] $= [l_i, r_i]$ represents an inclusive covered interval from $l_i$ to $r_i$.

Return a $2 ext{D}$ array representing all maximal contiguous uncovered intervals within the range $[0,$ n $- 1]$, sorted in ascending order by their start points. If all numbers in the range $[0,$ n $- 1]$ are covered, return an empty array.

Constraints:

• $1 \leq$ n $\leq 10^9$

• $0 \leq$ ranges.length $\leq 10^6$

• ranges[i].length $= 2$

• $0 \leq$ ranges[i][j] $\leq$ n $- 1$

• ranges[i][0] $\leq$ ranges[i][1]

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.