Create Shortest Subarray to be Removed to Make Array Sorted.java

varunu28 · web-flow · commit ceb871f66e65 · 2024-11-15T08:05:15.000-08:00
diff --git a/Medium/Shortest Subarray to be Removed to Make Array Sorted.java b/Medium/Shortest Subarray to be Removed to Make Array Sorted.java
@@ -0,0 +1,18 @@
+class Solution {
+    public int findLengthOfShortestSubarray(int[] arr) {
+        int right = arr.length - 1;
+        while (right > 0 && arr[right] >= arr[right - 1]) {
+            right--;
+        }
+        int result = right;
+        int left = 0;
+        while (left < right && (left == 0 || arr[left - 1] <= arr[left])) {
+            while (right < arr.length && arr[left] > arr[right]) {
+                right++;
+            }
+            result = Math.min(result, right - left - 1);
+            left++;
+        }
+        return result;
+    }
+}
