Time: 998 ms (5.00%) | Memory: 35.3 MB (24.23%) - LeetSync

Author: joshua-dierickse-alt

1286-constrained-subsequence-sum/constrained-subsequence-sum.py

@@ -0,0 +1,15 @@
+from sortedcontainers import SortedList
+
+class Solution:
+    def constrainedSubsetSum(self, nums: List[int], k: int) -> int:
+        avl = SortedList([nums[0]])
+
+        for i in range(1, len(nums)):
+            nums[i] = max(nums[i], avl[-1] + nums[i])
+
+            avl.add(nums[i])
+
+            if len(avl) > k:
+                avl.remove(nums[i - k])
+
+        return max(nums)