Time: 1 ms (100.00%), Space: 64.5 MB (92.00%) - LeetHub

py3-coder · py3-coder · commit 14a042b93956 · 2024-11-15T23:43:08.000+05:30
diff --git a/1574-shortest-subarray-to-be-removed-to-make-array-sorted/1574-shortest-subarray-to-be-removed-to-make-array-sorted.java b/1574-shortest-subarray-to-be-removed-to-make-array-sorted/1574-shortest-subarray-to-be-removed-to-make-array-sorted.java
@@ -0,0 +1,23 @@
+class Solution {
+    public int findLengthOfShortestSubarray(int[] arr) {
+        int left = 0;
+        while(left + 1 < arr.length && arr[left] <= arr[left+1]) left++;
+        if(left == arr.length - 1) return 0;
+        
+        int right = arr.length - 1;
+        while(right > left && arr[right-1] <= arr[right]) right--;
+        int result = Math.min(arr.length - left - 1, right);
+        
+        int i = 0;
+        int j = right;
+        while(i <= left && j < arr.length) {
+            if(arr[j] >= arr[i]) {
+                result = Math.min(result, j - i - 1);
+                i++;
+            }else {
+                j++;
+            }   
+        }
+        return result;
+    }
+}
