{"id":"time-complexity-sort-then-reduce","text":"`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.","truth_value":"IN","source":"entries/2026/06/06/delete-greatest-value-in-each-row-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"time-complexity-sort-then-reduce","truth_value":"IN","reason":"premise"}]}}