Nov 19

Author: siddydutta

2024-11-November-LeetCoding-Challenge/Maximum Sum of Distinct Subarrays With Length K.py

@@ -0,0 +1,34 @@
+from collections import defaultdict
+from typing import List
+
+
+class Solution:
+    def maximumSubarraySum(self, nums: List[int], k: int) -> int:
+        freq = defaultdict(int)
+        curr_sum, max_sum = 0, 0
+        for ptr, num in enumerate(nums):
+            curr_sum += num
+            freq[num] += 1
+            if ptr >= k:
+                prev = nums[ptr - k]
+                curr_sum -= prev
+                freq[prev] -= 1
+                if freq[prev] == 0:
+                    del freq[prev]
+            if len(freq) == k:
+                max_sum = max(max_sum, curr_sum)
+        return max_sum
+
+
+def main():
+    nums = [1, 5, 4, 2, 9, 9, 9]
+    k = 3
+    assert Solution().maximumSubarraySum(nums, k) == 15
+
+    nums = [4, 4, 4]
+    k = 3
+    assert Solution().maximumSubarraySum(nums, k) == 0
+
+
+if __name__ == '__main__':
+    main()

2024-11-November-LeetCoding-Challenge/README.md

@@ -21,7 +21,7 @@
 | November 16 | [3254. Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) | Medium | Solved |
 | November 17 | [862. Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/) | Hard | Solved |
 | November 18 | [1652. Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/) | Easy | Solved |
-| November 19 | []() |  |  |
+| November 19 | [2461. Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/) | Medium | Solved |
 | November 20 | []() |  |  |
 | November 21 | []() |  |  |
 | November 22 | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 13 | 6 | 7 |
+| Medium | 14 | 7 | 7 |
 | Hard   | 1 | 1 | 0 |