time-complexity-sort-then-reduce

Status: IN

`maxValueAfterOperations` runs in O(m * n log n) — dominated by sorting m rows of length n — followed by an O(m * n) column-max scan.

Source: entries/2026/06/06/delete-greatest-value-in-each-row-solution.md

JSON