Hackerrank's Sherlock and Array https://www.hackerrank.com/challenges/sherlock-and-array

SherlockAndArray.kt

package hakerrank

import kotlin.collections.*
import kotlin.io.*
import kotlin.text.*

/**
 * Hackerrank's Sherlock and Array
 * https://www.hackerrank.com/challenges/sherlock-and-array
 * 
 */

// Complete the balancedSums function below.
fun balancedSums(arr: Array<Int>): String {
    var positionLeft = 0
    var positionRight = arr.lastIndex
    var sum = 0
    while (positionLeft != positionRight) {
        if (sum >= 0) {
            sum -= arr[positionRight]
            positionRight--
        } else {
            sum += arr[positionLeft]
            positionLeft++
        }
    }
    return if (sum == 0) "YES" else "NO"
}

fun main(args: Array<String>) {
    val T = readLine()!!.trim().toInt()

    for (TItr in 1..T) {
        val n = readLine()!!.trim().toInt()

        val arr = readLine()!!.trimEnd().split(" ").map { it.toInt() }.toTypedArray()

        val result = balancedSums(arr)

        println(result)
    }
}