Given an array with all elements greater than or equal to zero. Return the maximum product of two numbers possible.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N, size of array. The second line of each test case contains array elements.
Print the maximum product of two numbers possible.
1 ≤ T ≤ 100
2 ≤ N ≤ 107
0 ≤ A[i] ≤ 104
1 100 42 4 23
Testcase 1: Two maximum numbers are 100 and 42 and their product is 4200.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.