package org.wesome.dsalgo;
public class EqualSumSplit {
static int equalSumSplit(int arr[]) {
int size = arr.length;
int sumFromRight = 0;
int sumFromLeft = 0;
int result = -1;
for (int i = 0; i < size; i++) {
sumFromLeft += arr[i];
}
for (int indx = size - 1; indx >= 0; indx--) {
sumFromRight = sumFromRight + arr[indx];
sumFromLeft = sumFromLeft - arr[indx];
if (sumFromRight == sumFromLeft) {
result = indx;
break;
}
}
if (result == -1 || result == size) {
System.out.println("Array cannot be split into equal sum sub array");
} else {
for (int i = 0; i < result; i++) {
System.out.print(arr[i] + " ");
}
System.out.print(" and ");
for (int i = result; i < size; i++) {
System.out.print(arr[i] + " ");
}
System.out.println("\n");
}
return result;
}
}