You are given an array of rectangles rectangles where rectangles[i] = [l_i, w_i] represents the $i^{ ext{th}}$ rectangle with a length of l_i and a width of w_i.

You can cut the $i^{ ext{th}}$ rectangle to form a square with a side length of at most $k$, where $k \leq$ l_i and $k \leq$ w_i. The maximum side length of a square obtained from cutting this rectangle is $\min( ext{`l_i`}, ext{`w_i`})$.

Let maxLen be the side length of the largest square that can be formed from any of the given rectangles.

Return the total number of rectangles that can produce a square with a side length of maxLen.

Constraints:

• $1 \leq$ rectangles.length $\leq 1000$

• rectangles[i].length $= 2$

• $1 \leq$ l_i, w_i $\leq 10^9$

• l_i $\neq$ w_i

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.