A $3 \times 3$ magic square is a $3 \times 3$ grid filled with distinct numbers from $1$ to $9$ such that every row, every column, and both diagonals share the same sum.

Given a row × col integer matrix grid, return the total number of contiguous $3 \times 3$ magic square subgrids within grid.

Constraints:

• row == grid.length

• col == grid[i].length

• $1 \leq$ row, col $\leq 10$

• $0 \leq$ grid[i][j] $\leq 15$

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.