Given an $m imes n$ binary matrix mat, return the total number of special positions in mat.

A position (i, j) is considered special if mat[i][j] is equal to $1$ and every other element in row i and column j is equal to $0$, assuming rows and columns are $0$ indexed.

Constraints:

• m == mat.length

• n == mat[i].length

• $1 \le$ m, n $\le 100$

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