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

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

| 2996|[Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2996.java)|| Easy|

| 2976 |[Minimum Cost to Convert String I](https://leetcode.com/problems/minimum-cost-to-convert-string-i/) |[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2976.java) | | Medium | Graph, Shortest Path

| 2974|[Minimum Number Game](https://leetcode.com/problems/minimum-number-game/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2974.java)|| Easy|

| 2970|[Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2970.java)|| Easy|

packagecom.fishercoder.solutions.thirdthousand;

importjava.util.HashSet;

importjava.util.Set;

publicclass_2996 {

publicstaticclassSolution1 {

publicintmissingInteger(int[]nums) {

intsum =nums[0];

for (inti =1;i <nums.length;i++) {

if (nums[i -1] +1 ==nums[i]) {

sum +=nums[i];

}else {

break;

}

}

Set<Integer>seen =newHashSet<>();

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

seen.add(nums[i]);

}

while (seen.contains(sum)) {

sum++;

}

returnsum;

}

}

}

packagecom.fishercoder.thirdthousand;

importcom.fishercoder.solutions.thirdthousand._2996;

importorg.junit.jupiter.api.BeforeEach;

importorg.junit.jupiter.api.Test;

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

publicclass_2996Test {

privatestatic_2996.Solution1solution1;

publicvoidsetup() {

solution1 =new_2996.Solution1();

}

publicvoidtest1() {

assertEquals(6,solution1.missingInteger(newint[]{1,2,3,2,5}));

}

publicvoidtest2() {

assertEquals(15,solution1.missingInteger(newint[]{3,4,5,1,12,14,13}));

}

publicvoidtest3() {

assertEquals(38,solution1.missingInteger(newint[]{37,1,2,9,5,8,5,2,9,4}));

}

publicvoidtest4() {

assertEquals(95,solution1.missingInteger(newint[]{47,48,2,6,9,5,10,5,6,7,6,9,8}));

}

}