Sliding Window/Maximum Sum of Distinct Subarrays With Length KMedium

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Maximum Sum of Distinct Subarrays With Length K

Sliding Window·Medium

Given an integer array nums and an integer k, return the maximum sum of any contiguous subarray of length exactly k whose elements are all distinct. If no such subarray exists, return 0.

A subarray qualifies only if every element inside the window appears exactly once.

Examples

Input: nums = [1,5,4,2,9,9,9], k = 3

Output: 15

Distinct windows of size 3 are `[1,5,4]=10`, `[5,4,2]=11`, `[4,2,9]=15`. Window `[2,9,9]` and `[9,9,9]` contain duplicates.

Input: nums = [4,4,4], k = 3

Output: 0

No window of size 3 has all distinct elements.

Constraints

1 <= k <= nums.length <= 10^5
1 <= nums[i] <= 10^5

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Sliding Window
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.