Jul 22

Author: siddydutta

2025-07-July-LeetCoding-Challenge/Maximum Erasure Value.py

@@ -0,0 +1,30 @@
+class Solution:
+    def maximumUniqueSubarray(self, nums: list[int]) -> int:
+        n = len(nums)
+        left_ptr, right_ptr = 0, 0
+        max_score, curr_score, elements = 0, 0, set()
+
+        while left_ptr < n and right_ptr < n:
+            if nums[right_ptr] not in elements:
+                curr_score += nums[right_ptr]
+                max_score = max(max_score, curr_score)
+                elements.add(nums[right_ptr])
+                right_ptr += 1
+            else:
+                curr_score -= nums[left_ptr]
+                elements.remove(nums[left_ptr])
+                left_ptr += 1
+
+        return max_score
+
+
+def main():
+    nums = [4, 2, 4, 5, 6]
+    assert Solution().maximumUniqueSubarray(nums) == 17
+
+    nums = [5, 2, 1, 2, 5, 2, 1, 2, 5]
+    assert Solution().maximumUniqueSubarray(nums) == 8
+
+
+if __name__ == '__main__':
+    main()

2025-07-July-LeetCoding-Challenge/README.md

@@ -25,7 +25,7 @@
 | July 19 | [1233. Remove Sub-Folders from the Filesystem](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem/) | Medium | Solved |
 | July 20 | [1948. Delete Duplicate Folders in System](https://leetcode.com/problems/delete-duplicate-folders-in-system/) | Hard | Unsolved |
 | July 21 | [1957. Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Easy | Solved |
-| July 22 | []() |  |  |
+| July 22 | [1695. Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/) | Medium | Solved |
 | July 23 | []() |  |  |
 | July 24 | []() |  |  |
 | July 25 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 8 | 7 | 1 |
+| Medium | 9 | 8 | 1 |
 | Hard   | 7 | 1 | 6 |