**Problem Description**

Given an array **A** containing **N** integers.

You need to find the **maximum sum of triplet** ( A_{i} + A_{j} + A_{k} ) such that 0 <= i < j < k < N and A_{i} < A_{j} < A_{k}.

If no such triplet exist return **0**.

3 <= N <= 10^{5}.

1 <= A[i] <= 10^{8}.

First argument is an integer array **A**.

Return a single integer denoting the maximum sum of triplet as described in the question.

Input 1:

A = [2, 5, 3, 1, 4, 9]

Input 2:

A = [1, 2, 3]

Output 1:

16

Output 2:

6

Explanation 1:

All possible triplets are:- 2 3 4 => sum = 9 2 5 9 => sum = 16 2 3 9 => sum = 14 3 4 9 => sum = 16 1 4 9 => sum = 14 Maximum sum = 16

Explanation 2:

All possible triplets are:- 1 2 3 => sum = 6 Maximum sum = 6

NOTE:You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.

Sign Up

to access hints and editorial solutions for**Maximum Sum Triplet**

to access hints and editorial solutions for

Loading...