Given an integer array nums and two positive integers m and k.

A subarray is considered almost unique if it contains at least m distinct elements.

Return the maximum sum of an almost unique subarray of length k. If no such subarray exists, return $0$.

Constraints:

• $1 \leq$ nums.length $\leq 2 imes 10^4$

• $1 \leq$ m $\leq$ k $\leq$ nums.length

• $1 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.