id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

array_balanced


Given an integer array "a", return true if the array has a place where you can split the array such that the sum of the numbers on one side of the split is the same as the numbers on the other. Return false if no such split exists.


array_balanced([1, 2, 3]) → true
array_balanced([1, 2, 2]) → false
array_balanced([1, 2, 3, 3, 4, 5]) → true

...Save, Compile, Run (ctrl-enter)

public boolean array_balanced(int[] a) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Post-solution available

Copyright Nick Parlante 2017 - privacy