Learn the essential features and functions of the popular JavaScript framework for building mobile, desktop and web applications.

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

canBalance([2, 1, 1, 2, 1]) → false

canBalance([10, 10]) → true

canBalance([1, 1, 1, 2, 1]) → true

canBalance([2, 1, 1, 2, 1]) → false

canBalance([10, 10]) → true

Experts Exchange Solution brought to you by

Enjoy your complimentary solution view.

Get every solution instantly with Premium.
Start your 7-day free trial.

I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial```
//Using ia1 as array here, but you can change it for demo purposes to other chosen test array values
class SplitTest{
public static void main(String[] args){
int[] ia1 = {2, 1, 1, 2, 1};
int total=0;
int accum = 0;
boolean breakout=false;
for(int i : ia1){total+=i;}
System.out.println("Total is "+total);
for(int y=0;y<ia1.length;y++){
accum+=ia1[y];
if((total-accum)==accum){
System.out.println("Split possible at index "+y);
breakout=true;
break;
}
}
if (breakout==false){System.out.println("No Split possible");}
}
}
/*
canBalance([1, 1, 1, 2, 1]) → true
canBalance([2, 1, 1, 2, 1]) → false
canBalance([10, 10]) → true
*/
```

```
int temp = 0;
int j_temp = 0;
int i_temp = 0;
boolean flag = false;
int[] x = new int[nums.length];
for (int j = nums.length - 1; j >= 0; j--) {
x[j] = temp + nums[j];
}
for (int i = 0; i < nums.length; i++) {
i_temp = i_temp + x[i];
for (int j = i + 1; j < nums.length; j++) {
j_temp = j_temp + nums[j];
}
if (i_temp == j_temp) {
flag = true;
break;
}
j_temp = 0;
}
return flag;
```

My source code krakatoa, Thanks for your code krakatoa

So as the actual canBalance code, it would be :

```
public boolean canBalance(int[] nums) {
int total=0;
int accum = 0;
for(int i : nums){total+=i;}
for(int y=0;y<nums.length;y++){
accum+=nums[y];
if((total-accum)==accum){
return true;
}
}
return false;
}
```

Java

From novice to tech pro — start learning today.

Experts Exchange Solution brought to you by

Enjoy your complimentary solution view.

Get every solution instantly with Premium.
Start your 7-day free trial.

then replace "+" with "="

if the sum works the answer is "True"

Now put the "+" back and move the "=" to the space between the next digits

Keep doing that until you reach the end of the string

If at any point the sum is valid your answer is "True" if there are no valid sums the answer is "False"

canBalance([1, 1, 1, 2, 1]) → true

1=1+1+2+1 = False

1+1=1+2+1 = False

1+1+1=2+1 = True1+1+1+2=1 = False

So for 1,1,1,2,1 overall the answer is "True"

canBalance([2, 1, 1, 2, 1]) → false

No combination of "+" and "=" produces a valid sum

canBalance([10, 10]) → true

10=10 = True

etc...