Maximum triplet sum in array
Basic Accuracy: 19.29% Submissions: 6019 Points: 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

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.