You are given an n $\times$ n integer matrix grid.

Construct an (n $- 2$) $\times$ (n $- 2$) integer matrix maxLocal such that maxLocal[i][j] is equal to the maximum value in the $3 \times 3$ submatrix of grid centered around row i $+ 1$ and column j $+ 1$.

Return the matrix maxLocal.

Constraints:

• n $==$ grid.length $==$ grid[i].length

• $3 \leq$ n $\leq 100$

• $1 \leq$ grid[i][j] $\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.