1
class Solution:
2
    def minimumDeletions(self, nums: List[int]) -> int:
3
        minFromFront = nums.index(min(nums))
4
        maxFromFront = nums.index(max(nums))
5

6
        minFromBack = len(nums) - minFromFront - 1
7
        maxFromBack = len(nums) - maxFromFront - 1
8

9
        return min(
10
            max(minFromFront, maxFromFront) + 1,  # Case 1
11
            max(minFromBack, maxFromBack) + 1,  # Case 2
12
            minFromBack + maxFromFront + 2,  # Case 3
13
            minFromFront + maxFromBack + 2,
14
        )  # Case 4