Haskell
halve :: [a] -> ([a], [a]) halve list = (take half list, drop (half + rest) list) where size = length list half = div size 2 rest = mod size 2 isEqualSides :: [Int] -> Int isEqualSides [] = -1 isEqualSides integers = if (sum firstHalf) == (sum secondHalf) then length firstHalf else isEqualSides (init firstHalf ++ tail secondHalf) where (firstHalf, secondHalf) = halve integers
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Haskell