Maximum triplet sum in array
Submissions: 5283   Accuracy:

15.47%

  Difficulty: Basic   Marks: 1

Given an array, the task is to find maximum triplet sum in the array.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains an Integer N denoting size of array and the second line contains N space separated elements.

Output:
For each test case, print the maximum triplet sum in new line.

Constraints:
1<=T<=100
3<=N<=106

-105<=A[i]<=105

Example:
Input:

2
6
1 0 8 6 4 2
7
1 2 3 0 -1 8 10

Output:
18
21

** For More Input/Output Examples Use 'Expected Output' option **

Author: arun03


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.