You are given a $2$D integer array intervals where intervals[i] = [left_i, right_i] represents the inclusive interval from left_i to right_i.

You want to divide the intervals into one or more groups such that every interval belongs to exactly one group, and no two intervals in the same group intersect each other.

Return the minimum number of groups needed.

Note: Two intervals intersect if there is at least one common point between them. For instance, the intervals [1, 5] and [5, 10] intersect because they share the common point $5$.

Constraints:

• $1 \leq$ intervals.length $\leq 10^5$

• intervals[i].length $= 2$

• $1 \leq$ left_i $\leq$ right_i $\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.