Leetcode 1827. Minimum Operations to Make the Array Increasing

Compute the minimum number of +1 operations to make an integer array strictly increasing; the optimal solution is a left-to-right greedy scan that raises any element below the required prev+1 value and accumulates the increments.