Leetcode 1727. Largest Submatrix With Rearrangements

Given a binary m x n matrix whose columns can be permuted arbitrarily, find the maximum area of an all-ones submatrix achievable after optimal column rearrangement. The core challenge is to use per-column consecutive-one heights (by row) and order columns to maximize width × minimum height for each row.