Given an integer array nums and an integer k, return an array ans of size nums.length $- k + 1$ where ans[i] is the number of distinct integers present in the subarray nums[i \dots i + k - 1].

Constraints:

• $1 \leq$ k $\leq$ nums.length $\leq 10^5$

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

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.