solves remove one element to make the array strictly increasing

Author: anishLearnsToCode

README.md

@@ -459,7 +459,7 @@
 | 1893 | [Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered)                        |                                                     [![Java](assets/java.png)](src/CheckIfAllTheIntegersInARangeAreCovered.java)                                                     |                                                                                                                                   |
 | 1897 | [Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal)                      |                                                   [![Java](assets/java.png)](src/RedistributeCharactersToMakeAllStringsEqual.java)                                                   |                                                                                                                                   |
 | 1903 | [Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string)                                                                |                                                            [![Java](assets/java.png)](src/LargestOddNumberInString.java)                                                             |                                                                                                                                   |
-| 1909 | [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing)        |                                                                                                                                                                                      |                                                                                                                                   |
+| 1909 | [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing)        |                                                [![Java](assets/java.png)](src/RemoveOneElementToMakeTheArrayStrictlyIncreasing.java)                                                 |                                                                                                                                   |
 | 1913 | [Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs)                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation)                                                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 1925 | [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples)                                                                        |                                                                                                                                                                                      |                                                                                                                                   |

src/RemoveOneElementToMakeTheArrayStrictlyIncreasing.java

@@ -0,0 +1,27 @@
+public class RemoveOneElementToMakeTheArrayStrictlyIncreasing {
+    public boolean canBeIncreasing(int[] array) {
+        if (array[0] >= array[1]) {
+            if (array.length == 2) return true;
+            return array[2] > array[1] && isStrictlyIncreasing(array, 3);
+        }
+        boolean firstAnomaly = true;
+        for (int index = 2 ; index < array.length ; index++) {
+            if (array[index] <= array[index - 1]) {
+                if (!firstAnomaly) return false;
+                firstAnomaly = false;
+                if (index == array.length - 1) return true;
+                if (array[index + 1] > array[index - 1]) continue;
+                if (array[index + 1] > array[index] && array[index] > array[index - 2]) continue;
+                return false;
+            }
+        }
+        return true;
+    }
+
+    private boolean isStrictlyIncreasing(int[] array, int start) {
+        for (int i = start ; i < array.length ; i++) {
+            if (array[i] <= array[i - 1]) return false;
+        }
+        return true;
+    }
+}