TapeEquilibrium 100% Solution in Javascript

Question

app.codility.com

My Solution (O(n))

app.codility.com

function solution(A) {

    let prefixSum = [];
    let suffixSum = [];
    
    prefixSum[0] = A[0];
    for (let i = 1; i < A.length; i++) {
        prefixSum[i] = prefixSum[i-1]+A[i];
    } 
    
    suffixSum[A.length-1] = A[A.length-1];
    for (let i = A.length-2; i >= 0; i--) {
        suffixSum[i] = suffixSum[i+1]+A[i];
    }
    
    let result = Number.MAX_SAFE_INTEGER;
    
    for (let i = 0; i < A.length-1; i++) {
        result = Math.min(result, Math.abs(prefixSum[i]-suffixSum[i+1]));
    }
    
    return result;
    
}