Find a point in an array where sum of left side array members(wrt to that point) and right side(wrt to that point) are equal..in other words equilibrium point.

public static int FindPoint(int[] arr){
int len=arr.length()-1;
int i=0;int j=len;
int left=0;
int right=0;
while(i<j){
if(left>right+arr[j]){
right+=arr[j--];
}
else if (right>left+arr[i]){
left+=arr[i++];
}
else{
return i;

}
}
return 0;
}