EqualSide.java

/**
find an index N where the sum of the integers to the left of N is equal to the sum of the integers to the right of N. 
If there is no index that would make this happen, return -1.

I/P:[1,2,3,4,3,2,1]

O/P: 3
*/


publicclassEqualSide {
publicstaticintfindEvenIndex(int[] arr) {
// your code
intsum = 0, eq = 0;
for (inti = 0; i < arr.length; i++){ 
sum += arr[i];
 }
for(inti = 0; i < arr.length; i++){
if (eq == sum - arr[i]){ 
returni;
 }
eq += arr[i];
sum -= arr[i];
 }
return -1;
 }

publicstaticvoidmain(String[] args){
int[] array = {1,2,3,4,3,2,1};
intsideVal = findEvenIndex(array);
System.out.println(sideVal);
 }
}