Add solution #3402

Author: JoshCrozier

README.md

@@ -361,9 +361,10 @@
 2490|[Circular Sentence](./2490-circular-sentence.js)|Easy|
 2529|[Maximum Count of Positive Integer and Negative Integer](./2529-maximum-count-of-positive-integer-and-negative-integer.js)|Easy|
 2535|[Difference Between Element Sum and Digit Sum of an Array](./2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
+3402|[Minimum Operations to Make Columns Strictly Increasing](./3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|
 
 ## License
 
 [MIT License](https://opensource.org/licenses/MIT)
 
-Copyright (c) 2019-2023 [Josh Crozier](https://joshcrozier.com)
+Copyright (c) 2019-2025 [Josh Crozier](https://joshcrozier.com)

solutions/3402-minimum-operations-to-make-columns-strictly-increasing.js

@@ -0,0 +1,32 @@
+/**
+ * 3402. Minimum Operations to Make Columns Strictly Increasing
+ * https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing
+ * Difficulty: Easy
+ *
+ * You are given a m x n matrix grid consisting of non-negative integers.
+ *
+ * In one operation, you can increment the value of any grid[i][j] by 1.
+ *
+ * Return the minimum number of operations needed to make all columns of grid strictly increasing.
+ */
+
+/**
+ * @param {number[][]} grid
+ * @return {number}
+ */
+var minimumOperations = function(grid) {
+  let count = 0;
+
+  for (let i = 1; i < grid.length; i++) {
+    for (let j = 0; j < grid[i].length; j++) {
+      const [previous, current] = [grid[i - 1][j], grid[i][j]];
+      if (current <= previous) {
+        const operations = previous - current + 1;
+        grid[i][j] = operations + current;
+        count += operations;
+      }
+    }
+  }
+
+  return count;
+};