1
class Solution:
2
    def findLengthOfShortestSubarray(self, arr: List[int]) -> int:
3
        n = len(arr)
4
        i = 0
5
        while i < n - 1 and arr[i + 1] >= arr[i]:
6
            i += 1
7

8
        if i == n - 1:
9
            return 0
10

11
        j = n - 1
12
        while j >= 0 and arr[j - 1] <= arr[j]:
13
            j -= 1
14

15
        ans = min(n, n - i - 1, j)
16

17
        for l in range(i + 1):
18
            r = j
19
            while r < n and arr[r] < arr[l]:
20
                r += 1
21
            ans = min(ans, r - l - 1)
22

23
        return ans