You are given an m $ imes$ n binary matrix grid.

A row or column is considered palindromic if its elements read the same forwards and backwards.

In one operation, you can flip any cell in grid from $0$ to $1$ or from $1$ to $0$.

Return the minimum number of flips required to make either all rows palindromic or all columns palindromic.

Constraints:

• m $==$ grid.length

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

• $1 \leq$ m * n $\leq 2 \cdot 10^5$

• $0 \leq$ grid[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.