1671

ramtanniru · ramtanniru · commit 62428bd301da · 2024-10-30T13:12:18.000+05:30
diff --git a/Oct-30-24.py b/Oct-30-24.py
@@ -0,0 +1,26 @@
+class Solution:
+    def minimumMountainRemovals(self, nums: List[int]) -> int:
+        lis, lds = [], []
+        lisArr, ldsArr = [], []
+        ans = 0
+        n = len(nums)
+        for i in nums:
+            if not lis or lis[-1]<i:
+                lis.append(i)
+            else:
+                idx = bisect_left(lis,i)
+                lis[idx] = i
+            lisArr.append(len(lis))
+        for i in nums[::-1]:
+            if not lds or lds[-1]<i:
+                lds.append(i)
+            else:
+                idx = bisect_left(lds,i)
+                lds[idx] = i
+            ldsArr.append(len(lds))
+        lds = lds[::-1]
+        ldsArr = ldsArr[::-1]
+        for i in range(n):
+            if lisArr[i]>1 and ldsArr[i]>1:
+                ans = max(ans,lisArr[i]+ldsArr[i]-1)
+        return n-ans
