gistfile1.txt

int equi(int A[], int n){
    int left = 0;
    int right = 0;
    int index = -1;
    
    // Sum the array
    int i = 0;
    
    for (i = 0; i < n; i++) {
        left += A[i];
    }
    
    //work backwrds from the end, dividing the array as you go.
    for (i = (n - 1); i >= 0; i--){
        if ((left - A[i]) == right){
            index = i;
            break;
        }else{
            left -= A[i];
            right += A[i];
        }
    }
    
    return index;
}