Available question text
Find the maximum sum of any contiguous subarray of length k that contains at least m distinct elements (return 0 if none). This is a sliding-window problem where you maintain the window sum and a frequency map to track distinct counts efficiently.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2841. Maximum Sum of Almost Unique Subarray
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source