3837. Delayed Count of Equal Elements

Use a hashmap.

Traverse from left to right, and at index i insert nums[i + k + 1] (if it exists) into the hashmap.

For the current index i, count how many of its occurrences are in the hashmap and push it into the result.

Reverse the resulting list and return it.