Given an $m imes n$ binary matrix matrix, return the total number of square submatrices containing all $1$s.

Constraints:

• $1 \leq$ matrix.length $\leq 300$

• $1 \leq$ matrix[0].length $\leq 300$

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