daily

Author: William Grolleau

problems/problem_1671/solution_1.py

@@ -0,0 +1,63 @@
+import pytest
+from typing import List
+import bisect
+import functools
+
+
+@functools.lru_cache()
+class Solution:
+    def minimumMountainRemovals(self, nums: List[int]) -> int:
+        def LIS(nums):
+            res = [1] * len(nums)
+            dp = [nums[0]]
+            for i in range(1, len(nums)):
+                idx = bisect.bisect_left(dp, nums[i])
+                if idx == len(dp):
+                    dp.append(nums[i])
+                else:
+                    dp[idx] = nums[i]
+                res[i] = len(dp)
+            return res
+
+        inc = LIS(nums)
+        dec = LIS(nums[::-1])[::-1]
+
+        res = 0
+        for i in range(len(nums)):
+            if inc[i] > 1 and dec[i] > 1:
+                res = max(res, inc[i] + dec[i] - 1)
+        return len(nums) - res
+
+
+tests = [
+    (
+        ([1, 3, 1],),
+        0,
+    ),
+    (
+        ([2, 1, 1, 5, 6, 2, 3, 1],),
+        3,
+    ),
+    (
+        ([1, 16, 84, 9, 29, 71, 86, 79, 72, 12],),
+        2,
+    ),
+    (
+        ([1, 2, 3, 4, 4, 3, 2, 1],),
+        1,
+    ),
+    (
+        ([9, 8, 1, 7, 6, 5, 4, 3, 2, 1],),
+        2,
+    ),
+    (
+        ([100, 92, 89, 77, 74, 66, 64, 66, 64],),
+        6,
+    ),
+]
+
+
+@pytest.mark.parametrize("inputs, expected", tests)
+def test_validator(inputs, expected):
+    output = Solution().minimumMountainRemovals(*inputs)
+    assert output == expected

problems/problem_2684/solution_1.py

@@ -0,0 +1,50 @@
+import pytest
+from typing import List
+
+
+class Solution:
+    def maxMoves(self, grid: List[List[int]]) -> int:
+        dp = [0] * len(grid)
+
+        for j in range(len(grid[0]) - 2, -1, -1):
+            curr_dp = [0] * len(grid)
+            for i in range(len(grid)):
+                for k in (i - 1, i, i + 1):
+                    if 0 <= k < len(grid) and grid[k][j + 1] > grid[i][j]:
+                        curr_dp[i] = max(curr_dp[i], 1 + dp[k])
+            dp = curr_dp
+
+        return max(dp)
+
+
+tests = [
+    (
+        ([[2, 4, 3, 5], [5, 4, 9, 3], [3, 4, 2, 11], [10, 9, 13, 15]],),
+        3,
+    ),
+    (
+        ([[3, 2, 4], [2, 1, 9], [1, 1, 7]],),
+        0,
+    ),
+    (
+        (
+            [
+                [187, 167, 209, 251, 152, 236, 263, 128, 135],
+                [267, 249, 251, 285, 73, 204, 70, 207, 74],
+                [189, 159, 235, 66, 84, 89, 153, 111, 189],
+                [120, 81, 210, 7, 2, 231, 92, 128, 218],
+                [193, 131, 244, 293, 284, 175, 226, 205, 245],
+            ],
+        ),
+        3,
+    ),
+]
+
+
+@pytest.mark.parametrize(
+    "inputs, expected",
+    tests,
+)
+def test_validator(inputs, expected):
+    output = Solution().maxMoves(*inputs)
+    assert output == expected