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

| 3491|[Phone Number Prefix](https://leetcode.com/problems/phone-number-prefix/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3491.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|

packagecom.fishercoder.solutions.fourththousand;

publicclass_3491 {

publicstaticclassSolution1 {

publicbooleanphonePrefix(String[]numbers) {

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

for (intj =0;j <numbers.length;j++) {

if (i !=j &&numbers[i].startsWith(numbers[j])) {

returnfalse;

}

}

}

returntrue;

}

}

}

packagecom.fishercoder.fourththousand;

importcom.fishercoder.solutions.fourththousand._3491;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

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

publicclass_3491Test {

private_3491.Solution1solution1;

publicvoidsetup() {

solution1 =new_3491.Solution1();

}

publicvoidtest1() {

assertEquals(true,solution1.phonePrefix(newString[]{"1","2","4","3"}));

}

}