Given an Array of non-negative integers. Find out the maximum perimeter of the triangle from the array.
The first line contains an integer T, the number of test cases. For each test case, the first line contains an integer n, the size of the array. Next line contains n- space separated integers.
For each test case, the output is an integer displaying the maximum perimeter if the triangle is possible else print -1.
6 1 6 5 8 4
7 55 20 1 4 33 12
1. Triangle formed by 8,6 & 6. Thus perimeter 20.
2. As the triangle is not possible because the condition: the sum of two sides should be greater than third is not fulfilled here.
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.