Practice Score After Flipping Matrix

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#861

LeetCode Problem

Score After Flipping Matrix

Array Greedy Bit Manipulation Matrix

Problem Statement

You are given an m x n binary matrix grid. A move consists of choosing any row or column and toggling each value in that row or column (i.e., changing all 0's to 1's, and all 1's to 0's). Every row of the matrix is interpreted as a binary number, and the score of the matrix is the sum of these numbers. Return the highest possible score after making any number of moves (including zero moves).

Source: Score After Flipping Matrix on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

grid = [[0,0,1,1],[1,0,1,0],[1,1,0,0]]

Output

# Example 2

Input

grid = [[0]]

Output

Constraints

m == grid.length

n == grid[i].length

1 <= m, n <= 20

grid[i][j] is either 0 or 1.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free