add 2996

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -1,5 +1,6 @@
 | #    | 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                                     |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2996.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2996 {
+    public static class Solution1 {
+        public int missingInteger(int[] nums) {
+            int sum = nums[0];
+            for (int i = 1; i < nums.length; i++) {
+                if (nums[i - 1] + 1 == nums[i]) {
+                    sum += nums[i];
+                } else {
+                    break;
+                }
+            }
+            Set<Integer> seen = new HashSet<>();
+            for (int i = 0; i < nums.length; i++) {
+                seen.add(nums[i]);
+            }
+            while (seen.contains(sum)) {
+                sum++;
+            }
+            return sum;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2996Test.java

@@ -0,0 +1,37 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2996;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2996Test {
+    private static _2996.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2996.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(6, solution1.missingInteger(new int[]{1, 2, 3, 2, 5}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(15, solution1.missingInteger(new int[]{3, 4, 5, 1, 12, 14, 13}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(38, solution1.missingInteger(new int[]{37, 1, 2, 9, 5, 8, 5, 2, 9, 4}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(95, solution1.missingInteger(new int[]{47, 48, 2, 6, 9, 5, 10, 5, 6, 7, 6, 9, 8}));
+    }
+
+}