Merge pull request SjxSubham#36 from emcc2302/main

Solving 3487. Maximum Unique Subarray Sum After Deletion
#### Solved

Author: SjxSubham

3487. Maximum Unique Subarray Sum After Deletion.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int maxSum(vector<int>& nums) {
+        unordered_set<int> s;
+        int temp = INT_MIN;
+        for(int i: nums){
+            if(i>0) s.insert(i);
+            else{
+                temp = max(temp,i);
+            }
+        }
+        return s.empty()?temp:accumulate(s.begin(), s.end(), 0);
+    }
+};