Given a $2$D integer matrix matrix and an integer target, return the number of non empty submatrices that sum to target.

A submatrix is defined by selecting all elements between a top left cell and a bottom right cell within matrix.

Constraints:

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

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

• $-1000 \leq$ matrix[i][j] $\leq 1000$

• $-10^8 \leq$ target $\leq 10^8$

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.