Problem

Submissions

Problem: Flip Columns For Maximum Number of Equal Rows

Statement

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$ .

Examples

Problem

Submissions

Problem: Flip Columns For Maximum Number of Equal Rows

Statement

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$ .

Examples