Given an Array of non-negative integers. Find out the maximum perimeter of the triangle from the array.

**Input:**

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.

**Output:**

For each test case, the output is an integer displaying the maximum perimeter if the triangle is possible else print **-1.**

**Constraints:**

1<=T<=100

3<=n<=100

**Example:
Input**

2

6

6 1 6 5 8 4

7

7 55 20 1 4 33 12

20

-1

**Explanation:
1. **Triangle formed by 8,6 & 6. Thus perimeter 20.

Author: Vanshika_pec

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.

thanuvinu94 | 238 |

the_coder95 | 215 |

ShivayLamba | 208 |

sandeep.prajapati | 129 |

Ashish Kumar Vaishy | 114 |

the_coder95 | 1441 |

RishabhTanwar1 | 1110 |

thanuvinu94 | 914 |

tathagat289 | 668 |

themanhasnoname | 620 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4897 |

Quandray | 4547 |

Login to report an issue on this page.