Given a $m × n$ binary matrix, filled with $0's$ and $1's$. Your task is to find the largest possible square composed entirely of cells with value $1$, and return the area of that square.

Constraints:

• $m ==$ matrix.length

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

• $1 <=m, n <= 300$

• matrix[i][j] is $0$ or $1$.

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.