You are given a two dimensional integer array intervals where intervals[i] $= [start_i, end_i]$ denotes an inclusive interval spanning from $start_i$ to $end_i$.

A set of integers nums is valid if its intersection with every interval in intervals contains at least $2$ distinct integers.

Return the minimum possible size of such a set nums.

Constraints:

• $1 \leq$ intervals.length $\leq 3000$

• intervals[i].length $= 2$

• $0 \leq start_i < end_i \leq 10^8$

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.