Time: 36 ms (73.52%), Space: 57.1 MB (84.54%) - LeetHub

py3-coder · py3-coder · commit 848dfecaea09 · 2024-11-19T16:33:50.000+05:30
diff --git a/2461-maximum-sum-of-distinct-subarrays-with-length-k/2461-maximum-sum-of-distinct-subarrays-with-length-k.java b/2461-maximum-sum-of-distinct-subarrays-with-length-k/2461-maximum-sum-of-distinct-subarrays-with-length-k.java
@@ -0,0 +1,23 @@
+class Solution {
+    public long maximumSubarraySum(int[] nums, int k) {
+        //Sliding window ::
+        int n = nums.length;
+        Set<Integer> set = new HashSet<>();
+        int start =0;
+        int end =0;
+        long sum=0, ans =0;
+        while(end<n){    
+            while (set.contains(nums[end]) || set.size() == k) {
+                set.remove(nums[start]);
+                sum -= nums[start++];
+            }
+            sum += nums[end];
+            set.add(nums[end]);
+            if (set.size() == k) {
+                ans = Math.max(ans, sum);
+            }
+            end++;
+        }
+        return ans;
+    }
+}
