Add solution #3487

JoshCrozier · JoshCrozier · commit eb4cf1c3a572 · 2025-07-24T22:48:57.000-05:00
diff --git a/README.md b/README.md
@@ -2709,6 +2709,7 @@
 3466|[Maximum Coin Collection](./solutions/3466-maximum-coin-collection.js)|Medium|
 3476|[Maximize Profit from Task Assignment](./solutions/3476-maximize-profit-from-task-assignment.js)|Medium|
 3481|[Apply Substitutions](./solutions/3481-apply-substitutions.js)|Medium|
+3487|[Maximum Unique Subarray Sum After Deletion](./solutions/3487-maximum-unique-subarray-sum-after-deletion.js)|Easy|
 3491|[Phone Number Prefix](./solutions/3491-phone-number-prefix.js)|Easy|
 3496|[Maximize Score After Pair Deletions](./solutions/3496-maximize-score-after-pair-deletions.js)|Medium|
 
diff --git a/solutions/3487-maximum-unique-subarray-sum-after-deletion.js b/solutions/3487-maximum-unique-subarray-sum-after-deletion.js
@@ -0,0 +1,29 @@
+/**
+ * 3487. Maximum Unique Subarray Sum After Deletion
+ * https://leetcode.com/problems/maximum-unique-subarray-sum-after-deletion/
+ * Difficulty: Easy
+ *
+ * You are given an integer array nums.
+ *
+ * You are allowed to delete any number of elements from nums without making it empty.
+ * After performing the deletions, select a subarray of nums such that:
+ * 1. All elements in the subarray are unique.
+ * 2. The sum of the elements in the subarray is maximized.
+ *
+ * Return the maximum sum of such a subarray.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxSum = function(nums) {
+  const uniqueValues = [...new Set(nums)];
+  const positiveValues = uniqueValues.filter(val => val > 0);
+
+  if (positiveValues.length === 0) {
+    return Math.max(...uniqueValues);
+  }
+
+  return positiveValues.reduce((sum, val) => sum + val, 0);
+};
