Available question text
Given a binary matrix and the ability to toggle entire rows or columns, determine whether you can turn every entry to 0 (and, if required, find a flip sequence or the minimum number of flips). The core challenge is modeling row/column flips as XOR operations over GF(2) and solving the resulting parity/linear-system or pattern-equivalence constraints.
Related questions
Continue with questions that share topics or the same question type.
- Remove All Ones With Row and Column Flips
Coding
- Check if Every Row and Column Contains All Numbers
Coding
- Difference Between Ones and Zeros in Row and Column
Coding
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2174. Remove All Ones With Row and Column Flips II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source