advent-of-code-2023/codewars/6-kyu/equal-sides-of-an-array/solution.hs

-- https://www.codewars.com/kata/5679aa472b8f57fb8c000047

module Codewars.G964.FindEven where

findEvenIndex :: [Int] -> Int
findEvenIndex arr = findEvenIndexImpl [] 0 arr

findEvenIndexImpl left n right
  | right == [] = -1
  | sum left == sum (tail right) = n
  | otherwise = findEvenIndexImpl (left ++ [head right]) (n + 1) (tail right)