[LEET-3402] add 3402

fishercoder1534 · fishercoder1534 · commit defdfd05639b · 2025-04-06T19:57:56.000-07:00
diff --git a/paginated_contents/algorithms/4th_thousand/README.md b/paginated_contents/algorithms/4th_thousand/README.md
@@ -2,6 +2,7 @@
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
 | 3502 | [Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java) |                                                                               | Easy       |
 | 3471 | [Find the Largest Almost Missing Integer](https://leetcode.com/problems/find-the-largest-almost-missing-integer/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3471.java) |                                                                               | Easy       |
+| 3402 | [Minimum Operations to Make Columns Strictly Increasing](https://leetcode.com/problems/minimum-operations-to-make-columns-strictly-increasing/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java) |                                                                               | Easy       |
 | 3396 | [Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3396.java) |                                                                               | Easy       |
 | 3392 | [Count Subarrays of Length Three With a Condition](https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3392.java) |                                                                               | Easy       |
 | 3386 | [Button with Longest Push Time](https://leetcode.com/problems/button-with-longest-push-time/)                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3386.java) |                                                                               | Easy       |
diff --git a/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java b/src/main/java/com/fishercoder/solutions/fourththousand/_3402.java
@@ -0,0 +1,18 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3402 {
+    public static class Solution1 {
+        public int minimumOperations(int[][] grid) {
+            int ops = 0;
+            for (int j = 0; j < grid[0].length; j++) {
+                for (int i = 1; i < grid.length; i++) {
+                    if (grid[i][j] <= grid[i - 1][j]) {
+                        ops += grid[i - 1][j] - grid[i][j] + 1;
+                        grid[i][j] = grid[i - 1][j] + 1;
+                    }
+                }
+            }
+            return ops;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/fourththousand/_3402Test.java b/src/test/java/com/fishercoder/fourththousand/_3402Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder.fourththousand;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.fourththousand._3402;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3402Test {
+    private _3402.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3402.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(15, solution1.minimumOperations(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[3,2],[1,3],[3,4],[0,1]")));
+    }
+}
