How to search for an element in an array while passing state for the next iteration

Search.scala

  val numbers = readLine().split(" ").map(_.toInt) // an array of numbers
  val leftSums = numbers.scan(0)(_ + _).init // calculate cumulative sums from left

  // search from right to find the same sum from left
  var sum = 0
  val result = numbers.zipWithIndex.reverse.find { case (number, index) =>
    if (sum == leftSums(index)) true
    else {
      sum = sum + number
      false
    }
  }

Would this work?

def sameSum(nums: List[(Int, Int)], sums: List[Int], total: Int = -1): Option[(Int, Int)] = {
  nums match {
    case Nil => None
    case h :: t =>
      if (total < 0) {
        if (h._1 == sums.head) Some(h) else sameSum(t, sums.tail, h._1)
      } else if (total == sums.head) Some(h)
      else sameSum(t, sums.tail, total + h._1)
  }
}

val numbers = readLine().split(" ").map(_.toInt).toList // an array of numbers
val leftSums = numbers.scan(0)(_ + _).init // calculate cumulative sums from left
sameSum(numbers.zipWithIndex.reverse, leftSums)

@korayal i want to use provided higher order functions only. @vy your solution seems to be what I want. But afaik scan is not lazy and it will scan the whole array.

@fehmicansaglam you can replace scan with a fold*/reduce variant by passing a list of accumulated values at each step.

@metanet unfortunately fold does not stop after it finds the solution. @vy the same answer applies for you:)

@metanet my answer for @korayal applies to you. And also this: https://twitter.com/fehmicans/status/593039964268552192