about | help | code help+videos | done | prefs |
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) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy