Problem of the day
If the array is [2, 3, 3, 4], the answer should be:-
-1
-1
18 (3 * 3 * 2)
36 (4 * 3 * 3)
The first line of input contains a single integer T, representing the number of test cases or queries to be run.
Then the T test cases follow.
The first line of each test case contains an integer N, representing the number of elements in the array.
The second line contains N single space-separated integers X[0],X[1],X[2].... X[N-1] where X[i] is an element of the array.
For each test case, return the required list. If there is no second largest or third largest number in the array X up to that index then print "-1", without the quotes.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 5
1 <= N <= 10^5
1 <= X[i] <= 10^6
Time limit: 1 sec
1
4
2 3 1 4
-1 -1 6 24
-1 (no second largest as well as third largest element is present)
-1 (no third largest element is present)
6 (3 * 2 * 1)
24 (4 * 3 * 2)
1
6
1 5 7 3 9 12
1 -1 35 105 315 756