Maximum triplet sum in array
Last Updated :
05 Nov, 2021
Given an array, the task is to find the maximum triplet sum in the array.
Examples :
Input : arr[] = {1, 2, 3, 0, -1, 8, 10}
Output : 21
10 + 8 + 3 = 21
Input : arr[] = {9, 8, 20, 3, 4, -1, 0}
Output : 37
20 + 9 + 8 = 37
Naive approach: In this method, we simply run three-loop and one by one add three-element and compare with the previous sum if the sum of three-element is greater than store in the previous sum.
C++
// C++ code to find maximum triplet sum
#include <bits/stdc++.h>
using namespace std;
int maxTripletSum(int arr[], int n)
{
// Initialize sum with INT_MIN
int sum = INT_MIN;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
for (int k = j + 1; k < n; k++)
if (sum < arr[i] + arr[j] + arr[k])
sum = arr[i] + arr[j] + arr[k];
return sum;
}
// Driven code
int main()
{
int arr[] = { 1, 0, 8, 6, 4, 2 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << maxTripletSum(arr, n);
return 0;
}
// Java code to find maximum triplet sum
import java.io.*;
class GFG {
static int maxTripletSum(int arr[], int n)
{
// Initialize sum with INT_MIN
int sum = -1000000;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
for (int k = j + 1; k < n; k++)
if (sum < arr[i] + arr[j] + arr[k])
sum = arr[i] + arr[j] + arr[k];
return sum;
}
// Driven code
public static void main(String args[])
{
int arr[] = { 1, 0, 8, 6, 4, 2 };
int n = arr.length;
System.out.println(maxTripletSum(arr, n));
}
}
// This code is contributed by Nikita Tiwari.
# Python 3 code to find
# maximum triplet sum
def maxTripletSum(arr, n) :
# Initialize sum with
# INT_MIN
sm = -1000000
for i in range(0, n) :
for j in range(i + 1, n) :
for k in range(j + 1, n) :
if (sm < (arr[i] + arr[j] + arr[k])) :
sm = arr[i] + arr[j] + arr[k]
return sm
# Driven code
arr = [ 1, 0, 8, 6, 4, 2 ]
n = len(arr)
print(maxTripletSum(arr, n))
# This code is contributed by Nikita Tiwari.
// C# code to find maximum triplet sum
using System;
class GFG {
static int maxTripletSum(int[] arr, int n)
{
// Initialize sum with INT_MIN
int sum = -1000000;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
for (int k = j + 1; k < n; k++)
if (sum < arr[i] + arr[j] + arr[k])
sum = arr[i] + arr[j] + arr[k];
return sum;
}
// Driven code
public static void Main()
{
int[] arr = { 1, 0, 8, 6, 4, 2 };
int n = arr.Length;
Console.WriteLine(maxTripletSum(arr, n));
}
}
// This code is contributed by vt_m.
<?php
// PHP code to find maximum triplet sum
function maxTripletSum( $arr, $n)
{
// Initialize sum with INT_MIN
$sum = PHP_INT_MIN;
for($i = 0; $i < $n; $i++)
for($j = $i + 1; $j < $n; $j++)
for($k = $j + 1; $k < $n; $k++)
if ($sum < $arr[$i] +
$arr[$j] +
$arr[$k])
$sum = $arr[$i] +
$arr[$j] +
$arr[$k];
return $sum;
}
// Driver Code
$arr = array(1, 0, 8, 6, 4, 2);
$n = count($arr);
echo maxTripletSum($arr, $n);
// This code is contributed by anuj_67.
?>
<script>
// JavaScript Program to find maximum triplet sum
function maxTripletSum(arr, n)
{
// Initialize sum with INT_MIN
let sum = -1000000;
for (let i = 0; i < n; i++)
for (let j = i + 1; j < n; j++)
for (let k = j + 1; k < n; k++)
if (sum < arr[i] + arr[j] + arr[k])
sum = arr[i] + arr[j] + arr[k];
return sum;
}
// Driver code
let arr = [ 1, 0, 8, 6, 4, 2 ];
let n = arr.length;
document.write(maxTripletSum(arr, n));
</script>
// This code is contributed by sanjoy_62.
Output:
18
Time complexity : O(n^3)
Space complexity : O(1)
Another approach: In this, we first need to sort the whole array and after that when we add the last three-element of the array then we find the maximum sum of triplets.
C++
// C++ code to find maximum triplet sum
#include <bits/stdc++.h>
using namespace std;
// This function assumes that there are at least
// three elements in arr[].
int maxTripletSum(int arr[], int n)
{
// sort the given array
sort(arr, arr + n);
// After sorting the array.
// Add last three element of the given array
return arr[n - 1] + arr[n - 2] + arr[n - 3];
}
// Driven code
int main()
{
int arr[] = { 1, 0, 8, 6, 4, 2 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << maxTripletSum(arr, n);
return 0;
}
// Java code to find maximum triplet sum
import java.io.*;
import java.util.*;
class GFG {
// This function assumes that there are
// at least three elements in arr[].
static int maxTripletSum(int arr[], int n)
{
// sort the given array
Arrays.sort(arr);
// After sorting the array.
// Add last three element
// of the given array
return arr[n - 1] + arr[n - 2] + arr[n - 3];
}
// Driven code
public static void main(String args[])
{
int arr[] = { 1, 0, 8, 6, 4, 2 };
int n = arr.length;
System.out.println(maxTripletSum(arr, n));
}
}
// This code is contributed by Nikita Tiwari.
# Python 3 code to find
# maximum triplet sum
# This function assumes
# that there are at least
# three elements in arr[].
def maxTripletSum(arr, n) :
# sort the given array
arr.sort()
# After sorting the array.
# Add last three element
# of the given array
return (arr[n - 1] + arr[n - 2] + arr[n - 3])
# Driven code
arr = [ 1, 0, 8, 6, 4, 2 ]
n = len(arr)
print(maxTripletSum(arr, n))
# This code is contributed by Nikita Tiwari.
// C# code to find maximum triplet sum
using System;
class GFG {
// This function assumes that there are
// at least three elements in arr[].
static int maxTripletSum(int[] arr, int n)
{
// sort the given array
Array.Sort(arr);
// After sorting the array.
// Add last three element
// of the given array
return arr[n - 1] + arr[n - 2] + arr[n - 3];
}
// Driven code
public static void Main()
{
int[] arr = { 1, 0, 8, 6, 4, 2 };
int n = arr.Length;
Console.WriteLine(maxTripletSum(arr, n));
}
}
// This code is contributed by vt_m.
<?php
// PHP code to find
// maximum triplet sum
// This function assumes that
// there are at least
// three elements in arr[].
function maxTripletSum( $arr, $n)
{
// sort the given array
sort($arr);
// After sorting the array.
// Add last three element
// of the given array
return $arr[$n - 1] + $arr[$n - 2] +
$arr[$n - 3];
}
// Driver code
$arr = array( 1, 0, 8, 6, 4, 2 );
$n = count($arr);
echo maxTripletSum($arr, $n);
// This code is contributed by anuj_67.
?>
<script>
//Javascript code to find maximum triplet sum
// This function assumes that there are at least
// three elements in arr[].
function maxTripletSum(arr, n)
{
// sort the given array
arr.sort();
// After sorting the array.
// Add last three element of the given array
return arr[n - 1] + arr[n - 2] + arr[n - 3];
}
// Driven code
let arr = [ 1, 0, 8, 6, 4, 2 ];
let n = arr.length;
document.write(maxTripletSum(arr, n));
// This code is contributed by Mayank Tyagi
</script>
Output:
18
Time complexity: O(nlogn)
Space complexity: O(1)
Efficient approach: Scan the array and compute the Maximum, second maximum, and third maximum element present in the array and return the sum of its and it would be maximum sum.
C++
// C++ code to find maximum triplet sum
#include <bits/stdc++.h>
using namespace std;
// This function assumes that there are at least
// three elements in arr[].
int maxTripletSum(int arr[], int n)
{
// Initialize Maximum, second maximum and third
// maximum element
int maxA = INT_MIN, maxB = INT_MIN, maxC = INT_MIN;
for (int i = 0; i < n; i++) {
// Update Maximum, second maximum and third
// maximum element
if (arr[i] > maxA) {
maxC = maxB;
maxB = maxA;
maxA = arr[i];
}
// Update second maximum and third maximum
// element
else if (arr[i] > maxB) {
maxC = maxB;
maxB = arr[i];
}
// Update third maximum element
else if (arr[i] > maxC)
maxC = arr[i];
}
return (maxA + maxB + maxC);
}
// Driven code
int main()
{
int arr[] = { 1, 0, 8, 6, 4, 2 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << maxTripletSum(arr, n);
return 0;
}
// Java code to find maximum triplet sum
import java.io.*;
import java.util.*;
class GFG {
// This function assumes that there
// are at least three elements in arr[].
static int maxTripletSum(int arr[], int n)
{
// Initialize Maximum, second maximum and third
// maximum element
int maxA = -100000000, maxB = -100000000;
int maxC = -100000000;
for (int i = 0; i < n; i++) {
// Update Maximum, second maximum
// and third maximum element
if (arr[i] > maxA)
{
maxC = maxB;
maxB = maxA;
maxA = arr[i];
}
// Update second maximum and third maximum
// element
else if (arr[i] > maxB)
{
maxC = maxB;
maxB = arr[i];
}
// Update third maximum element
else if (arr[i] > maxC)
maxC = arr[i];
}
return (maxA + maxB + maxC);
}
// Driven code
public static void main(String args[])
{
int arr[] = { 1, 0, 8, 6, 4, 2 };
int n = arr.length;
System.out.println(maxTripletSum(arr, n));
}
}
// This code is contributed by Nikita Tiwari.
# Python 3 code to find
# maximum triplet sum
# This function assumes
# that there are at least
# three elements in arr[].
def maxTripletSum(arr, n) :
# Initialize Maximum, second
# maximum and third maximum
# element
maxA = -100000000
maxB = -100000000
maxC = -100000000
for i in range(0, n) :
# Update Maximum, second maximum
# and third maximum element
if (arr[i] > maxA) :
maxC = maxB
maxB = maxA
maxA = arr[i]
# Update second maximum and
# third maximum element
elif (arr[i] > maxB) :
maxC = maxB
maxB = arr[i]
# Update third maximum element
elif (arr[i] > maxC) :
maxC = arr[i]
return (maxA + maxB + maxC)
# Driven code
arr = [ 1, 0, 8, 6, 4, 2 ]
n = len(arr)
print(maxTripletSum(arr, n))
# This code is contributed by Nikita Tiwari.
// C# code to find maximum triplet sum
using System;
class GFG {
// This function assumes that there
// are at least three elements in arr[].
static int maxTripletSum(int[] arr, int n)
{
// Initialize Maximum, second maximum
// and third maximum element
int maxA = -100000000, maxB = -100000000;
int maxC = -100000000;
for (int i = 0; i < n; i++) {
// Update Maximum, second maximum
// and third maximum element
if (arr[i] > maxA) {
maxC = maxB;
maxB = maxA;
maxA = arr[i];
}
// Update second maximum and third
// maximum element
else if (arr[i] > maxB) {
maxC = maxB;
maxB = arr[i];
}
// Update third maximum element
else if (arr[i] > maxC)
maxC = arr[i];
}
return (maxA + maxB + maxC);
}
// Driven code
public static void Main()
{
int[] arr = { 1, 0, 8, 6, 4, 2 };
int n = arr.Length;
Console.WriteLine(maxTripletSum(arr, n));
}
}
// This code is contributed by vt_m.
<?php
// PHP code to find
// maximum triplet sum
// This function assumes that
// there are at least three
// elements in arr[].
function maxTripletSum($arr, $n)
{
// Initialize Maximum,
// second maximum and
// third maximum element
$maxA = PHP_INT_MIN;
$maxB = PHP_INT_MIN;
$maxC = PHP_INT_MIN;
for ( $i = 0; $i < $n; $i++)
{
// Update Maximum,
// second maximum and
// third maximum element
if ($arr[$i] > $maxA)
{
$maxC = $maxB;
$maxB = $maxA;
$maxA = $arr[$i];
}
// Update second maximum and
// third maximum element
else if ($arr[$i] > $maxB)
{
$maxC = $maxB;
$maxB = $arr[$i];
}
// Update third maximum element
else if ($arr[$i] > $maxC)
$maxC = $arr[$i];
}
return ($maxA + $maxB + $maxC);
}
// Driven code
$arr = array( 1, 0, 8, 6, 4, 2 );
$n = count($arr);
echo maxTripletSum($arr, $n);
// This code is contributed by anuj_67.
?>
<script>
// JavaScript code to find maximum triplet sum
// This function assumes that there are at least
// three elements in arr[].
function maxTripletSum(arr, n)
{
// Initialize Maximum, second maximum and third
// maximum element
let maxA = Number.MIN_SAFE_INTEGER;
let maxB = Number.MIN_SAFE_INTEGER;
let maxC = Number.MIN_SAFE_INTEGER;
for (let i = 0; i < n; i++) {
// Update Maximum, second maximum and third
// maximum element
if (arr[i] > maxA) {
maxC = maxB;
maxB = maxA;
maxA = arr[i];
}
// Update second maximum and third maximum
// element
else if (arr[i] > maxB) {
maxC = maxB;
maxB = arr[i];
}
// Update third maximum element
else if (arr[i] > maxC)
maxC = arr[i];
}
return (maxA + maxB + maxC);
}
// Driven code
let arr = [ 1, 0, 8, 6, 4, 2 ];
let n = arr.length;
document.write(maxTripletSum(arr, n));
// This code is contributed by Surbhi Tyagi.
</script>
Output:
18
Time complexity : O(n)
Space complexity : O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem