|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------

| 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|

packagecom.fishercoder.solutions.fourththousand;

publicclass_3402 {

publicstaticclassSolution1 {

publicintminimumOperations(int[][]grid) {

intops =0;

for (intj =0;j <grid[0].length;j++) {

for (inti =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;

}

}

}

returnops;

}

}

}

packagecom.fishercoder.fourththousand;

importcom.fishercoder.common.utils.CommonUtils;

importcom.fishercoder.solutions.fourththousand._3402;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

importstaticorg.junit.jupiter.api.Assertions.assertEquals;

publicclass_3402Test {

private_3402.Solution1solution1;

publicvoidsetup() {

solution1 =new_3402.Solution1();

}

publicvoidtest1() {

assertEquals(15,solution1.minimumOperations(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[3,2],[1,3],[3,4],[0,1]")));

}

}