You are given an array of $n$ pairs pairs where pairs[i] = $[left_i, right_i]$ and $left_i < right_i$.

A pair $p_2 = [c, d]$ can follow another pair $p_1 = [a, b]$ to form a chain if and only if $b < c$. You can select pairs in any order to construct the chain.

Return the maximum length of a chain that can be formed.

Constraints:

• n $==$ pairs.length

• $1 \leq$ n $\leq 1000$

• $-1000 \leq left_i < right_i \leq 1000$

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.