You are given an $m imes n$ binary grid mat.

Find two non overlapping square submatrices of equal side length containing only $1$s such that the area of each square is maximized. Return the maximum possible area of one such square submatrix. If it is impossible to find two non overlapping squares containing only $1$s, return $0$.

Note: Two square submatrices are non overlapping if they do not share any common cells.

Constraints:

• mat.length $= m$

• mat[i].length $= n$

• $1 \leq m, n \leq 500$

• mat[i][j] is either $0$ or $1$.

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.