Given an $m \times n$ binary matrix, matrix, return the maximum number of rows where all values become identical after flipping any number of columns. Flipping a column means changing every $0$ to $1$ and every $1$ to $0$ in that column.

Constraints:

• $m ==$ matrix.length

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

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

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