Maximum Sum of Distinct Subarrays With Length K / visualized

A fixed-size window of length k slides across the array. A running sum tracks the window's total, and a frequency map tracks duplicates — the window only counts toward the answer when every value inside it is distinct.