Create Maximum Sum of Distinct Subarrays With Length K

Maximum Sum of Distinct Subarrays With Length K

@@ -0,0 +1,25 @@
+class Solution {
+public:
+    long long maximumSubarraySum(vector<int>& nums, int k) {
+        long long ans = 0, sum = 0;
+        unordered_map<int, int> mp;
+        int i = 0;
+        while(i < k  && i < nums.size()){ // store first k elements in the map
+            mp[nums[i]]++;
+            sum += nums[i];
+            i++;
+        }
+        if(mp.size() == k) ans = sum; // if all distinct, then ans = sum 
+        while(i < nums.size()){
+            mp[nums[i]]++;
+            mp[nums[i-k]]--;
+            if(mp[nums[i-k]] == 0) mp.erase(nums[i-k]);
+
+            sum += nums[i];
+            sum -= nums[i-k];
+            if(mp.size() == k) ans = max(ans, sum);
+            i++;
+        }
+        return ans;
+    }
+};