You are given a $0$ indexed integer array nums of length n and a non negative integer k.

For each index i where $0 \leq i < n$, find the number of indices j that satisfy:

• $i + k < j < n$

• nums[j] == nums[i]

Return an integer array ans of length n, where ans[i] is the count of such indices j for each i.

Constraints:

• $1 \leq n ==$ nums.length $\leq 10^5$

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

• $0 \leq k \leq n - 1$

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.