You are given an integer array candies, where each element candies[i] represents the flavor of the $i$-th candy. You are also given an integer k.

You need to give away a contiguous sequence of $k$ candies to your friend. After sharing these candies, you keep all the remaining candies.

Return the maximum number of unique flavors you can have among the remaining candies.

Constraints:

• $0 \leq$ candies.length $\leq 10^5$

• $1 \leq$ candies[i] $\leq 10^5$

• $0 \leq$ k $\leq$ candies.length

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.