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