Leetcode 3402. Minimum Operations to Make Columns Strictly Increasing

Given an m x n grid of nonnegative integers where you may increment any cell by 1, compute the minimum total increments needed so that each column is strictly increasing from top to bottom. This reduces to independently ensuring each cell in a column is at least one greater than the previous (a greedy monotonic adjustment).