Maximum erasure value

leetcode/README.md

@@ -96,4 +96,5 @@
 | 1184 | [Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)                                         | [C](./src/1184.c) | Easy       |
 | 1189 | [Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)                                         | [C](./src/1189.c) | Easy       |
 | 1207 | [Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)                                     | [C](./src/1207.c) | Easy       |
+| 1695 | [Maximum Erasure Value](Maximum Erasure Value)                                                                                  | [C](./src/1695.c) | Medium     |
 | 2130 | [Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)                           | [C](./src/2130.c) | Medium     |

leetcode/src/1695.c

@@ -0,0 +1,30 @@
+
+// Window sliding. Runtime: O(n), Space: O(n)
+int maximumUniqueSubarray(int* nums, int numsSize){
+    short* numsSet = (short*)calloc(10001, sizeof(short));
+    numsSet[nums[0]] = 1;
+
+    int maxSum = nums[0];
+
+    int windowSumm = maxSum;
+    int leftIndex = 0;
+
+    int num = 0;
+    for(int i = 1; i < numsSize; i++){
+        num = nums[i];
+        while (numsSet[num] != 0){
+            numsSet[nums[leftIndex]] = 0;
+            windowSumm -= nums[leftIndex];
+            leftIndex++;
+        }
+
+        numsSet[num] = 1;
+        windowSumm += num;
+
+        if (maxSum < windowSumm){
+            maxSum = windowSumm;
+        }
+    }
+
+    return maxSum;
+}