3837. Delayed Count of Equal Elements - Practice Online

You are given an integer array nums of length n and an integer k.

For each index i, define the delayed count as the number of indices j such that:

Return an array ans where ans[i] is the delayed count of index i.

Example 1:

Input: nums = [1,2,1,1], k = 1

Output: [2,0,0,0]

Explanation:

`i`	`nums[i]`	possible `j`	`nums[j]`	satisfying `nums[j] == nums[i]`	`ans[i]`
0	1	[2, 3]	[1, 1]	[2, 3]	2
1	2	[3]	[1]	[]	0
2	1	[]	[]	[]	0
3	1	[]	[]	[]	0

Thus, ans = [2, 0, 0, 0].

Example 2:

Input: nums = [3,1,3,1], k = 0

Output: [1,1,0,0]

Explanation:

`i`	`nums[i]`	possible `j`	`nums[j]`	satisfying `nums[j] == nums[i]`	`ans[i]`
0	3	[1, 2, 3]	[1, 3, 1]	[2]	1
1	1	[2, 3]	[3, 1]	[3]	1
2	3	[3]	[1]	[]	0
3	1	[]	[]	[]	0

Thus, ans = [1, 1, 0, 0].

Constraints: