add 2970

Author: fishercoder1534

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

@@ -1,5 +1,6 @@
 | #    | Title                                                                                                                                                                                         | Solutions                                                                                                                                                              | Video                                | Difficulty                | Tag                                                                  
 |------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------|---------------------------|----------------------------------------------------------------------
+| 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                      |
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                      |
 | 2864 | [Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2864.java)                                       |                                      | Easy                      |Greedy
 | 2824 | [Count Pairs Whose Sum is Less than Target](https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2824.java)                                       |                                      | Easy                      |

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

@@ -0,0 +1,36 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2970 {
+    public static class Solution1 {
+        public int incremovableSubarrayCount(int[] nums) {
+            int count = 0;
+            for (int i = 0; i < nums.length; i++) {
+                for (int j = i; j < nums.length; j++) {
+                    if (strictlyInc(nums, i, j)) {
+                        count++;
+                    }
+                }
+            }
+            return count;
+        }
+
+        private boolean strictlyInc(int[] nums, int start, int finish) {
+            List<Integer> list = new ArrayList<>();
+            for (int i = 0; i < start; i++) {
+                list.add(nums[i]);
+            }
+            for (int i = finish + 1; i < nums.length; i++) {
+                list.add(nums[i]);
+            }
+            for (int i = 0; i < list.size() - 1; i++) {
+                if (list.get(i) >= list.get(i + 1)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}

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

@@ -0,0 +1,31 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2970;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2970Test {
+    private static _2970.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2970.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(7, solution1.incremovableSubarrayCount(new int[]{6, 5, 7, 8}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3, solution1.incremovableSubarrayCount(new int[]{8, 7, 6, 6}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(3, solution1.incremovableSubarrayCount(new int[]{8, 7, 6, 6}));
+    }
+}