Given a two-dimensional integer array intervals of length $n$, where each intervals[i] $= [ ext{start}_i, ext{end}_i]$ represents an inclusive interval from $ ext{start}_i$ to $ ext{end}_i$, return the total number of pairs of intervals $(i, j)$ with $0 \leq i < j < n$ that intersect.

Two intervals intersect if they have at least one common point.

Constraints:

• $2 \leq n ==$ intervals.length $\leq 100$

• intervals[i] $= [ ext{start}_i, ext{end}_i]$

• $0 \leq ext{start}_i \leq ext{end}_i \leq 100$

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.