Leetcode 2174. Remove All Ones With Row and Column Flips II

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.