You are given an $m \times n$ binary matrix grid.

In one operation, you can choose any row or column and invert all of its values (changing every $0$ to $1$ and every $1$ to $0$).

Return true if it is possible to transform grid such that all its elements become $0$ after applying any number of operations, or false otherwise.

Constraints:

• m $==$ grid.length

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

• $1 \leq$ m, n $\leq 300$

• grid[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.