Leetcode 861. Score After Flipping Matrix

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

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 861. Score After Flipping Matrix

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact