Python Sliding Window
\nclass Solution:\n    def findLengthOfShortestSubarray(self, arr: List[int]) -> int:\n        left = 0\n        size = len(arr)\n        right = size -1\n     
```\nclass Solution:\n    def findLengthOfShortestSubarray(self, arr: List[int]) -> int:\n        left = 0\n        size = len(arr)\n        right = size -1\n        while(left < right) and arr[left] <= arr[left+1]:\n            left += 1\n        if left == right:\n            return 0\n        while(left < right) and arr[right-1]<=arr[right]:\n            right -= 1    \n        result = min(size-1-left, right)\n        l = 0\n        r = right\n        while(l <= left and r < size):\n            if arr[l] <= arr[r]:\n                result = min(result, r-l-1)\n                l += 1\n            else:\n                r += 1\n        return result\n\t\t```
[]