Split array into three equal sum segments
Last Updated :
29 Oct, 2024
Given an integer array arr[], the task is to divide the array into three non-empty contiguous segments with equal sum. In other words, we need to return an index pair [i, j], such that sum(arr[0...i]) = sum(arr[i+1...j]) = sum(arr[j+1...n-1]).
Note: If it is impossible to divide the array into three non-empty contiguous segments, return [-1, -1].
Examples:
Input: arr[] = [1, 3, 4, 0, 4]
Output: [1, 2]
Explanation: 3 equal sum segments are: arr[0...1], arr[2...2] and arr[3...4] each having sum = 4.
Input: arr[] = [2, 3, 4]
Output: [-1, -1]
Explanation: No three segments exist which has equal sum.
Input: arr[] = [1, -1, 1, -1, 1, -1, 1, -1]
Output: [1, 3]
Explanation: 3 equal sum segments are: arr[0...1], arr[2...3] and arr[4...7] each having sum = 0.
[Naive Approach] By finding all possible partitions - O(n^3) Time and O(1) Space
The idea is to try all possible partitions using two variables, say i and j such that the first segment will be arr[0...i], the second segment will be arr[i+1...j] and the third segment will be arr[j+1...n-1]. For any partition, if the sum of all three segments are equal, then we can return [i, j] as a valid partition. Otherwise, return [-1, -1].
C++
// C++ program to find if the array can be divided into
// three segments by finding all possible partitions
#include <iostream>
#include <vector>
using namespace std;
// function to find the sum of subarray arr[start...end]
int findSum(vector<int> &arr, int start, int end) {
int sum = 0;
for(int i = start; i <= end; i++)
sum += arr[i];
return sum;
}
// function to return the index pair of equal sum segments
vector<int> findSplit(vector<int> &arr) {
int n = arr.size();
// First partition
for(int i = 0; i < n - 2; i++) {
// Second Partition
for(int j = i + 1; j < n - 1; j++) {
// Find sum of all three segments
int sum1 = findSum(arr, 0, i);
int sum2 = findSum(arr, i + 1, j);
int sum3 = findSum(arr, j + 1, n - 1);
// If all three segments have equal sum,
// then return true
if(sum1 == sum2 && sum2 == sum3)
return {i, j};
}
}
// No possible index pair found
return {-1, -1};
}
int main() {
vector<int> arr = {1, 3, 4, 0, 4};
vector<int> res = findSplit(arr);
cout << res[0] << " " << res[1];
return 0;
}
C
// C program to find if the array can be divided into
// three segments by finding all possible partitions
#include <stdio.h>
// function to find the sum of subarray arr[start...end]
int findSum(int *arr, int start, int end) {
int sum = 0;
for(int i = start; i <= end; i++)
sum += arr[i];
return sum;
}
// function to return the index pair of equal sum segments
int* findSplit(int *arr, int n) {
int *res = (int *)malloc(2 * sizeof(int));
res[0] = -1;
res[1] = -1;
// First partition
for(int i = 0; i < n - 2; i++) {
// Second Partition
for(int j = i + 1; j < n - 1; j++) {
// Find sum of all three segments
int sum1 = findSum(arr, 0, i);
int sum2 = findSum(arr, i + 1, j);
int sum3 = findSum(arr, j + 1, n - 1);
// If all three segments have equal sum,
// then return true
if(sum1 == sum2 && sum2 == sum3) {
res[0] = i;
res[1] = j;
return res;
}
}
}
// No possible index pair found
return res;
}
int main() {
int arr[] = {1, 3, 4, 0, 4};
int n = sizeof(arr) / sizeof(arr[0]);
int *res = findSplit(arr, n);
printf("%d %d", res[0], res[1]);
return 0;
}
Java
// Java program to find if the array can be divided into
// three segments by finding all possible partitions
class GfG {
// function to find the sum of subarray arr[start...end]
static int findSum(int[] arr, int start, int end) {
int sum = 0;
for (int i = start; i <= end; i++)
sum += arr[i];
return sum;
}
// function to return the index pair of equal sum segments
static int[] findSplit(int[] arr) {
int n = arr.length;
// First partition
for (int i = 0; i < n - 2; i++) {
// Second Partition
for (int j = i + 1; j < n - 1; j++) {
// Find sum of all three segments
int sum1 = findSum(arr, 0, i);
int sum2 = findSum(arr, i + 1, j);
int sum3 = findSum(arr, j + 1, n - 1);
// If all three segments have equal sum,
// then return true
if (sum1 == sum2 && sum2 == sum3)
return new int[]{i, j};
}
}
// No possible index pair found
return new int[]{-1, -1};
}
public static void main(String[] args) {
int[] arr = {1, 3, 4, 0, 4};
int[] res = findSplit(arr);
System.out.println(res[0] + " " + res[1]);
}
}
Python
# Python program to find if the array can be divided into
# three segments by finding all possible partitions
# function to find the sum of subarray arr[start...end]
def findSum(arr, start, end):
sum_ = 0
for i in range(start, end + 1):
sum_ += arr[i]
return sum_
# function to return the index pair of equal sum segments
def findSplit(arr):
n = len(arr)
# First partition
for i in range(n - 2):
# Second Partition
for j in range(i + 1, n - 1):
# Find sum of all three segments
sum1 = findSum(arr, 0, i)
sum2 = findSum(arr, i + 1, j)
sum3 = findSum(arr, j + 1, n - 1)
# If all three segments have equal sum,
# then return true
if sum1 == sum2 and sum2 == sum3:
return [i, j]
# No possible index pair found
return [-1, -1]
if __name__ == "__main__":
arr = [1, 3, 4, 0, 4]
res = findSplit(arr)
print(res[0], res[1])
C#
// C# program to find if the array can be divided into
// three segments by finding all possible partitions
using System;
using System.Collections.Generic;
class GfG {
// function to find the sum of subarray arr[start...end]
static int findSum(int[] arr, int start, int end) {
int sum = 0;
for (int i = start; i <= end; i++)
sum += arr[i];
return sum;
}
// function to return the index pair of equal sum segments
static int[] findSplit(int[] arr) {
int n = arr.Length;
// First partition
for (int i = 0; i < n - 2; i++) {
// Second Partition
for (int j = i + 1; j < n - 1; j++) {
// Find sum of all three segments
int sum1 = findSum(arr, 0, i);
int sum2 = findSum(arr, i + 1, j);
int sum3 = findSum(arr, j + 1, n - 1);
// If all three segments have equal sum,
// then return true
if (sum1 == sum2 && sum2 == sum3)
return new int[] { i, j };
}
}
// No possible index pair found
return new int[] { -1, -1 };
}
static void Main() {
int[] arr = { 1, 3, 4, 0, 4 };
int[] res = findSplit(arr);
Console.WriteLine(res[0] + " " + res[1]);
}
}
JavaScript
// JavaScript program to find if the array can be divided
// into three segments by finding all possible partitions
// function to find the sum of subarray arr[start...end]
function findSum(arr, start, end) {
let sum = 0;
for (let i = start; i <= end; i++)
sum += arr[i];
return sum;
}
// function to return the index pair of equal sum segments
function findSplit(arr) {
let n = arr.length;
// First partition
for (let i = 0; i < n - 2; i++) {
// Second Partition
for (let j = i + 1; j < n - 1; j++) {
// Find sum of all three segments
let sum1 = findSum(arr, 0, i);
let sum2 = findSum(arr, i + 1, j);
let sum3 = findSum(arr, j + 1, n - 1);
// If all three segments have equal sum,
// then return true
if (sum1 === sum2 && sum2 === sum3)
return [i, j];
}
}
// No possible index pair found
return [-1, -1];
}
// Driver Code
const arr = [1, 3, 4, 0, 4];
const res = findSplit(arr);
console.log(res[0] + " " + res[1]);
[Expected Approach] Finding first two segments- O(n) Time and O(1) Space
To split the array into three equal segments, we first need to make sure that the total sum of the array is divisible by 3. Then, as we iterate through the array, we calculate the running sum. If running sum becomes equal to one-third of the total, we reset the running sum to zero and store the index as the first element of the index pair. If we find another index for which the running sum becomes equal to one-third of the total and there are still elements left for a third segment, then store the index as the second element of the index pair and return the index pair.
We only need the first two segments with sum equal to one-third of the total because the remaining subarray will always be the third segment.
Working:
C++
// C++ program to find if the array can be divided into
// three segments by finding first two segments
#include <iostream>
#include <vector>
using namespace std;
// function to return the index pair of equal sum segments
vector<int> findSplit(vector<int> &arr) {
vector<int> res;
int total = 0;
for (int ele : arr)
total += ele;
// If the total sum is not divisible by 3,
// it's impossible to split the array
if (total % 3 != 0) {
res = {-1, -1};
return res;
}
// Keep track of the sum of current segment
int currSum = 0;
for (int i = 0; i < arr.size(); i++) {
currSum += arr[i];
// If the valid segment is found, store its index
// and reset current sum to zero
if (currSum == total / 3) {
currSum = 0;
res.push_back(i);
// If two valid segments are found and third non
// empty segment is possible, return the index pair
if (res.size() == 2 && i < arr.size() - 1)
return res;
}
}
// If no index pair is possible
res = {-1, -1};
return res;
}
int main() {
vector<int> arr = {1, 3, 4, 0, 4};
vector<int> res = findSplit(arr);
cout << res[0] << " " << res[1];
return 0;
}
C
// C program to find if the array can be divided into
// three segments by finding first two segments
#include <stdio.h>
int *findSplit(int *arr, int n) {
int *res = (int *)malloc(2 * sizeof(int));
int resIdx = 0;
int total = 0;
for (int i = 0; i < n; i++)
total += arr[i];
// If the total sum is not divisible by 3,
// it's impossible to split the array
if (total % 3 != 0) {
res[0] = -1;
res[1] = -1;
return res;
}
// Keep track of the sum of current segment
int currSum = 0;
for (int i = 0; i < n; i++) {
currSum += arr[i];
// If the valid segment is found, store its index
// and reset current sum to zero
if (currSum == total / 3) {
currSum = 0;
res[resIdx++] = i;
// If two valid segments are found and third non
// empty segment is possible, return true
if (resIdx == 2 && i < n - 1) {
return res;
}
}
}
res[0] = -1;
res[1] = -1;
return res;
}
int main()
{
int arr[] = {1, 3, 4, 0, 4};
int size = sizeof(arr) / sizeof(arr[0]);
int *res = findSplit(arr, size);
printf("%d %d\n", res[0], res[1]);
return 0;
}
Java
// Java program to find if the array can be divided into
// three segments by finding first two segments
import java.util.Arrays;
class GfG {
static int[] findSplit(int[] arr) {
int[] res = new int[2];
int n = arr.length;
int resIdx = 0;
int total = 0;
for (int i = 0; i < n; i++)
total += arr[i];
// If the total sum is not divisible by 3,
// it's impossible to split the array
if (total % 3 != 0) {
res[0] = -1;
res[1] = -1;
return res;
}
// Keep track of the sum of current segment
int currSum = 0;
for (int i = 0; i < n; i++) {
currSum += arr[i];
// If the valid segment is found, store its index
// and reset current sum to zero
if (currSum == total / 3) {
currSum = 0;
res[resIdx++] = i;
// If two valid segments are found and third non
// empty segment is possible, return true
if (resIdx == 2 && i < n - 1) {
return res;
}
}
}
res[0] = -1;
res[1] = -1;
return res;
}
public static void main(String[] args) {
int[] arr = {1, 3, 4, 0, 4};
int[] res = findSplit(arr);
System.out.println(res[0] + " " + res[1]);
}
}
Python
# Python program to find if the array can be divided into
# three segments by finding first two segments
# function to return the index pair of equal sum segments
def findSplit(arr):
res = []
total = 0
for ele in arr:
total += ele
# If the total sum is not divisible by 3,
# it's impossible to split the array
if total % 3 != 0:
res = [-1, -1]
return res
# Keep track of the sum of current segment
currSum = 0
for i in range(len(arr)):
currSum += arr[i]
# If the valid segment is found, store its index
# and reset current sum to zero
if currSum == total / 3:
currSum = 0
res.append(i)
# If two valid segments are found and third non
# empty segment is possible, return the index pair
if len(res) == 2 and i < len(arr) - 1:
return res
# If no index pair is possible
res = [-1, -1]
return res
if __name__ == "__main__":
arr = [1, 3, 4, 0, 4]
res = findSplit(arr)
print(res[0], res[1])
C#
// C# program to find if the array can be divided into
// three segments by finding first two segments
using System;
class GfG {
static int[] findSplit(int[] arr) {
int[] res = new int[2];
int n = arr.Length;
int resIdx = 0;
int total = 0;
for (int i = 0; i < n; i++)
total += arr[i];
// If the total sum is not divisible by 3,
// it's impossible to split the array
if (total % 3 != 0) {
res[0] = -1;
res[1] = -1;
return res;
}
// Keep track of the sum of current segment
int currSum = 0;
for (int i = 0; i < n; i++) {
currSum += arr[i];
// If the valid segment is found, store its index
// and reset current sum to zero
if (currSum == total / 3) {
currSum = 0;
res[resIdx++] = i;
// If two valid segments are found and third non
// empty segment is possible, return true
if (resIdx == 2 && i < n - 1) {
return res;
}
}
}
res[0] = -1;
res[1] = -1;
return res;
}
static void Main() {
int[] arr = { 1, 3, 4, 0, 4 };
int[] res = findSplit(arr);
Console.WriteLine($"{res[0]} {res[1]}");
}
}
JavaScript
// JavaScript program to find if the array can be divided into
// three segments by finding first two segments
// function to return the index pair of equal sum segments
function findSplit(arr) {
let res = [];
let total = 0;
for (let ele of arr)
total += ele;
// If the total sum is not divisible by 3,
// it's impossible to split the array
if (total % 3 !== 0) {
res = [-1, -1];
return res;
}
// Keep track of the sum of current segment
let currSum = 0;
for (let i = 0; i < arr.length; i++) {
currSum += arr[i];
// If the valid segment is found, store its index
// and reset current sum to zero
if (currSum === total / 3) {
currSum = 0;
res.push(i);
// If two valid segments are found and third non
// empty segment is possible, return the index pair
if (res.length === 2 && i < arr.length - 1)
return res;
}
}
// If no index pair is possible
res = [-1, -1];
return res;
}
// Driver Code
const arr = [1, 3, 4, 0, 4];
const res = findSplit(arr);
console.log(res[0], res[1]);
Partition Array Into Three Parts With Equal Sum
Visit Course
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