You are given a $2\text{D}$ integer array coords where coords[i] = [x_i, y_i] represents a point on a $2\text{D}$ plane.

Find the maximum value of $2 \times \text{area}$ of a triangle with a positive area formed by any three distinct points in coords such that at least one of its sides is parallel to the x axis or the y axis.

Return this maximum value, or $-1$ if no such triangle can be formed.

Constraints:

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

• $1 \leq$ coords[i][0], coords[i][1] $\leq 10^6$

• All coords[i] are unique.

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.