LeetCode 2461: Maximum Sum of Distinct Subarrays With Length K Solution

Master LeetCode problem 2461 (Maximum Sum of Distinct Subarrays With Length K), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2461. Maximum Sum of Distinct Subarrays With Length K

Medium

Array Hash Table Sliding Window

Problem Explanation

Explanation

To solve this problem, we can use a sliding window approach with a HashSet to keep track of distinct elements in the current window. We will iterate through the array, maintaining a window of size k and calculating the sum of elements in the window as long as all elements are distinct. If we encounter a duplicate element, we will slide the window to the right until the duplicate element is no longer in the window.

At each step, we update the maximum sum of distinct subarrays encountered so far. Finally, we return the maximum sum found.

Time complexity: O(n), where n is the number of elements in the array nums.
Space complexity: O(k), where k is the size of the HashSet representing the window.

Solution Code

import java.util.HashSet;

class Solution {
    public int maxSumOfDistinctSubarrays(int[] nums, int k) {
        int n = nums.length;
        int maxSum = 0;
        int sum = 0;
        HashSet<Integer> set = new HashSet<>();
        
        for (int i = 0, j = 0; j < n; j++) {
            while (set.contains(nums[j])) {
                sum -= nums[i];
                set.remove(nums[i]);
                i++;
            }
            sum += nums[j];
            set.add(nums[j]);
            
            if (j - i + 1 == k) {
                maxSum = Math.max(maxSum, sum);
                sum -= nums[i];
                set.remove(nums[i]);
                i++;
            }
        }
        
        return maxSum;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2461 (Maximum Sum of Distinct Subarrays With Length K)?

This page provides optimized solutions for LeetCode problem 2461 (Maximum Sum of Distinct Subarrays With Length K) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2461 (Maximum Sum of Distinct Subarrays With Length K)?

The time complexity for LeetCode 2461 (Maximum Sum of Distinct Subarrays With Length K) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2461 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2461 in Java, C++, or Python.

Back to LeetCode Solutions