{{ !articles[0].partner.isSponsoringArticle ? "Platinum" : "Portal" }} Partner
java,code puzzler

Thursday Code Puzzler: Balancing Arrays

Thursday is code puzzler day here at DZone. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.

Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer.  It's all about the participation!

Do you have code puzzlers that you'd like to share with the DZone community?  If so, please submit here. 

Balancing Arrays

In today's challenge, given an array of values, write a method that returns the index of the point in the array where the sum of numbers on one side is equal to the sum of the numbers on the other side. The method returns -1 otherwise.

So for the array {1,1,1,1} you could return index 1 as we break the array after the second element to balance it.

Catch up on all our previous puzzlers here.

{{ tag }}, {{tag}},

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}
{{ parent.authors[0].realName || parent.author}}

{{ parent.authors[0].tagline || parent.tagline }}

{{ parent.views }} ViewsClicks