Available question text
Given an m×n binary matrix where you may toggle any row or column, maximize the sum of rows interpreted as binary numbers. The optimal greedy strategy is to ensure every row's most-significant bit is 1, then for each column choose flips to maximize the count of 1s (weighted by that bit's place value).
Related questions
Continue with questions that share topics or the same question type.
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 861. Score After Flipping Matrix
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source