Problem of the day
Let us suppose the numbers are chosen by participants: [2, 6, 5, 2, 3] and K = 3, then the distinct pairs having differences equal to K are: [2, 5] and [3, 6] so print 2.
The list of numbers can contain duplicate numbers, you need to print only the distinct pairs.
For example [2, 2, 3, 4] and K = 1, so you need to print 2 as the two distinct pairs are: (2, 3) and (3, 4).
The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case will contain two space-separated integers ‘N’ and ‘K’, where ‘N’ denotes the number of elements of the array that contains the chosen numbers, and ‘K’ denotes the difference required between the pair elements.
The second line of each test case will contain ‘N’ space-separated integers denoting the chosen numbers by the participants.
For each test case, print a single integer that denotes the distinct pairs having differences equal to K.
Output for every test case will be printed in a separate line.
1 <= T <= 10^2
0 <= N <= 10^4
0 <= K <= 10^4
0 <= ARR[i] <= 10^9
Where ‘ARR[i]’ is the value of elements of the array.
Time Limit: 1 sec
2
5 3
2 6 5 2 3
4 1
1 1 2 2
2
1
In the first test case,
The distinct pairs having difference equal to 3 are (2, 5) and (3, 6)
In the second test case,
The distinct pairs having a difference equal to 1 is (1, 2)
3
3 2
2 6 4
3 1
1 2 4
6 1
1 2 3 4 5 6
2
1
5
In the first test case,
The distinct pairs having difference equal to 2 are (2, 4) and (4, 6)
In the second test case,
The distinct pairs having a difference equal to 1 is (1, 2)
In the third test case,
The distinct pairs having difference equal to 1 are (1, 2), (2, 3), (3, 4), (4, 5) and (5, 6)