1574

Author: ramtanniru

Nov-15-24.py

@@ -0,0 +1,20 @@
+class Solution:
+ def findLengthOfShortestSubarray(self, arr: List[int]) -> int:
+ n = len(arr)
+ l,r = 0,n-1
+ while l<n-1 and arr[l]<=arr[l+1]:
+ l += 1
+ while r>0 and arr[r]>=arr[r-1]:
+ r -= 1
+ if l>=r:
+ return 0
+ ans = min(n-l-1,r)
+ i = 0
+ j = r
+ while i<=l and j<n:
+ if arr[i]<=arr[j]:
+ ans = min(ans,j-i-1)
+ i += 1
+ else:
+ j += 1
+ return ans