Given a $2$D grid of $0$s and $1$s named grid, find the maximum number of elements contained in a square subgrid such that all elements along its border are $1$. If no such subgrid exists, return $0$.

Constraints:

• $1 \leq$ grid.length $\leq 100$

• $1 \leq$ grid[0].length $\leq 100$

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