From c5d42f83fce72c792c7a26440d6c8cd016795055 Mon Sep 17 00:00:00 2001 From: Amit S Sahu Date: Wed, 30 Oct 2024 11:12:11 +0530 Subject: [PATCH] Create README - LeetHub --- .../README.md | 39 +++++++++++++++++++ 1 file changed, 39 insertions(+) create mode 100644 1671-minimum-number-of-removals-to-make-mountain-array/README.md diff --git a/1671-minimum-number-of-removals-to-make-mountain-array/README.md b/1671-minimum-number-of-removals-to-make-mountain-array/README.md new file mode 100644 index 0000000..9f441ff --- /dev/null +++ b/1671-minimum-number-of-removals-to-make-mountain-array/README.md @@ -0,0 +1,39 @@ +

1671. Minimum Number of Removals to Make Mountain Array

Hard

You may recall that an array arr is a mountain array if and only if:

+ + + +

Given an integer array nums​​​, return the minimum number of elements to remove to make nums​​​ a mountain array.

+ +

 

+

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].
+
+ +

 

+

Constraints:

+ +