Leetcode 2841. Maximum Sum of Almost Unique Subarray

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.