Create Maximum Unique Subarray Sum After Deletion.java

varunu28 · web-flow · commit 8ed8a35ed862 · 2025-03-19T06:48:37.000-07:00
diff --git a/Easy/Maximum Unique Subarray Sum After Deletion.java b/Easy/Maximum Unique Subarray Sum After Deletion.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int maxSum(int[] nums) {
+        int max = nums[0];
+        int sum = 0;
+        Set<Integer> set = new HashSet<>();
+        for (int num : nums) {
+            max = Math.max(num, max);
+            if (num > 0 && set.add(num)) {
+                sum += num;
+            }
+        }
+        if (max < 0) {
+            return max;
+        }
+        return sum;
+    }
+}
