Hi,

I am working on below challenge

http://codingbat.com/prob/p158767
I have not understood the description properly

Given a non-empty array, return true if there is a place to split the array so that the sum of the numbers on one side is equal to the sum of the numbers on the other side.

canBalance([1, 1, 1, 2, 1]) → true//i thought since 1+1 is not equal to 2+1 it should be false?

canBalance([2, 1, 1, 2, 1]) → false//i thought since 2+1 is equal to 2+1 it should be true??

canBalance([10, 10]) → true

please advise

front and middle and back

But, they want us to split the array into two pieces

front and back

[1, 1, 1, 2, 1] can balance 1+1+1 == 2 +1

[2, 1, 1, 2, 1] can't balance

[2, 2,1,5] can balance 2+2+1 == 5

My solution has nested for loops . Something like

for( whole array){

for( front){ add them}

for( back){add them}

if front equals back return true

}