[Python3] 6-line
\n\nclass Solution:\n    def findLengthOfShortestSubarray(self, arr: List[int]) -> int:\n        lo = next((i for i in range(len(arr)-1) if arr[i] > arr[i+1]), 
\n```\nclass Solution:\n    def findLengthOfShortestSubarray(self, arr: List[int]) -> int:\n        lo = next((i for i in range(len(arr)-1) if arr[i] > arr[i+1]), None)\n        hi = next((i for i in reversed(range(1, len(arr))) if arr[i-1] > arr[i]), None)\n        if lo is None: return 0 \n        \n        ll = bisect_right(arr, arr[hi], 0, lo+1)\n        rr = bisect_left(arr, arr[lo], hi, len(arr))\n        \n        return min(hi - ll, rr - lo - 1)\n```
['Python3']