Create 3487. Maximum Unique Subarray Sum After Deletion (#848)

Author: Chayandas07

3487. Maximum Unique Subarray Sum After Deletion

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int maxSum(vector<int>& nums) {
+        unordered_set<int> seen;
+        int sum = -101;
+        
+        for (int i = 0; i < nums.size(); ++i) {
+            if (nums[i] < 0 || seen.count(nums[i])) {
+                if (sum < 0) {
+                    sum = max(sum, nums[i]);
+                }
+                continue;
+            } else {
+                sum = max(sum, 0);
+                sum += nums[i];
+                seen.insert(nums[i]);
+            }
+        }
+        
+        return sum;
+    }
+};