Given an $m \times n$ integer matrix grid, return the size of the largest magic square subgrid contained within grid.

A magic square is defined as a $k \times k$ subgrid where the sum of elements in every row, the sum of elements in every column, and the sum of elements along both diagonals are all equal. Note that any $1 \times 1$ grid is always a magic square of size $1$.

Constraints:

• m == grid.length

• n == grid[i].length

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

• $1 \leq$ grid[i][j] $\leq 10^6$

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.