Problem of the day
Return 0, if there are no such two students present.
The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case will contain a single integer ‘N’ which denotes the number of students in the row.
The second line of each test case contains the ‘N’ space-separated integers in which the “i-th” number represents the marks of the “i-th” student.
For each test case, print the maximum difference between the two students described above. If, there are no such students then print 0.
Output for every test case will be printed in a separate line.
You don’t need to print anything; It has already been taken care of.
1 <= T <= 50
2 <= N <= 10000
0 <= arr[ i ] <= 10^5
Where ‘T’ is the number of test cases.
Where 'N' is the number of students in the row and “arr[ i ]” denotes the marks of “i-th” student.
Time limit: 1 sec
2
3
1 2 3
8
4 3 2 8 1 3 3 3
2
6
In the first test case, the students with marks 1 and 3 ( 1<= 3) have the maximum difference between their positions.
In the second test case, the students with marks 3 and 3 ( 3<= 3) have the maximum difference between their positions, 7 - 1 = 6.
2
2
5 6
2
6 5
1
0
In the first test case, the students with marks 5 and 6 ( 5 <= 6) have the maximum difference between their positions.
In the second test case, there are no such students present.