Leetcode 1671. Minimum Number of Removals to Make Mountain Array

class Solution:
    def minimumMountainRemovals(self, nums: List[int]) -> int:
        n = len(nums)
        maximum = 0
        for index in range(1, n - 1):
            left = [nums[index]]
            for i in range(index - 1, -1, -1):
                if nums[i] >= nums[index] or nums[i] == left[0]:
                    continue
                elif nums[i] < left[0]:
                    bisect.insort(left, nums[i])
                else:
                    pos = bisect.bisect(left, nums[i])
                    left[pos-1] = nums[i]
            if len(left) < 2:
                continue
            right = [nums[index]]
            for i in range(index+1, n):
                if nums[i] >= nums[index] or nums[i] == right[0]:
                    continue
                if nums[i] < right[0]:
                    bisect.insort(right, nums[i])
                else:
                    pos = bisect.bisect(right, nums[i])
                    right[pos-1] = nums[i]
            if len(right) > 1:
                maximum = max(maximum, len(left) + len(right) - 1)
        return n - maximum

class Solution:
    def minimumMountainRemovals(self, nums: List[int]) -> int:
        n = len(nums)
        maximum = 0
        left = self.LIS(nums)
        right = self.LIS(nums[::-1])
        for i in range(n):
            if left[i] > 1 and right[n-i-1] > 1:
                maximum = max(maximum, left[i] + right[n-i-1] - 1)
        return n - maximum


    def LIS(self, nums):
        n = len(nums)
        dp = [1] * n
        arr = [nums[0]]
        for i in range(1, n):
            if nums[i] > arr[-1]:
                arr.append(nums[i])
            else:
                pos = bisect.bisect_left(arr, nums[i])
                arr[pos] = nums[i]
            dp[i] = len(arr)
        return dp