#1671

Minimum Number of Removals to Make Mountain Array

expert · 1295 · lc hard +32 · verified · 54.8% accepted · 2,285 likes · top 48%

Description

An array is a mountain array if it has at least three elements and strictly increases to a peak element, then strictly decreases. Given integer array nums, return the minimum number of elements to remove so the remaining array forms a mountain.

Example 1:

Input: nums = [1,3,1]

Output: 0

Explanation: The array itself is a mountain array so we do not need to remove any elements.

Example 2:

Input: nums = [2,1,1,5,6,2,3,1]

Output: 3

Explanation: One solution is to remove the elements at indices 0, 1, and 5, making the array nums = [1,5,6,3,1].

Code

1

2

3

class Solution:
    def minimumMountainRemovals(self, nums: List[int]) -> int:

class Solution:
    def minimumMountainRemovals(self, nums: List[int]) -> int: