You are given a $2$D integer array dimensions of size $n$, where dimensions[i] contains two integers representing the length and width of the $i$-th rectangle.

Return the area of the rectangle that has the longest diagonal. If multiple rectangles tie for the longest diagonal length, return the maximum area among those rectangles.

Constraints:

• $1 \leq$ dimensions.length $\leq 100$

• dimensions[i].length $= 2$

• $1 \leq$ dimensions[i][0], dimensions[i][1] $\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.