| # | Title | Solutions | Video | Difficulty | Tag

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

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

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

packagecom.fishercoder.solutions.fourththousand;

publicclass_3502 {

publicstaticclassSolution1 {

publicint[]minCosts(int[]cost) {

int[]res =newint[cost.length];

intmin =cost[0];

for (inti =0;i <cost.length;i++) {

if (cost[i] <min) {

min =cost[i];

}

res[i] =min;

}

returnres;

}

}

}

packagecom.fishercoder.fourththousand;

importcom.fishercoder.solutions.fourththousand._3502;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

importstaticorg.junit.jupiter.api.Assertions.assertArrayEquals;

publicclass_3502Test {

private_3502.Solution1solution1;

publicvoidsetup() {

solution1 =new_3502.Solution1();

}

publicvoidtest1() {

assertArrayEquals(newint[]{5,3,3,1,1,1},solution1.minCosts(newint[]{5,3,4,1,3,2}));

}

}