Find out middle index where sum of both ends are equal.

//Here first we traverse the array once to find total sum of array…. then we again start from 0th position and start subtracting value from total sum and go on adding it to leftsum and then compare leftsum and total remaining sum

public class FindMiddleIndexWhenSumOfBothSidesEqual {

 public static int findMiddleIndexMethod(int[] intArray){

int sumArray = 0;

int leftSumArray=0;

for (int i=0; i<intArray.length;i++){

sumArray+=intArray[i];

}

 for (int j=0; j<intArray.length; j++){

sumArray=sumArray-intArray[j];

 if (leftSumArray==sumArray){

return j;

}

leftSumArray+=intArray[j];

}

return -1;

}

public static void main(String[] args) {

int[] ia = {1, 5, 8, 7, 8, 1, 5};

int mi = findMiddleIndexMethod(ia);

System.out.print(“Middle index of the array when both ends sums equal: “+ia[mi]);

 }

}