string balancedSums(vector<int> arr) {
    int ls = 0, rs = accumulate(arr.begin(), arr.end(), 0);
    for(int i = 0; i < arr.size(); i++){
        rs -= arr[i];
        if(i != 0) ls += arr[i-1];
        if(ls == rs) return "YES";
    }
    return "NO";
}

public static String balancedSums(List<Integer> arr) {
        // goal: find element of arr where sum of elements to left equals sum of elements to the right
        if(arr.size() == 1) return "YES"; //left = 0 = right
        
        int totalSum = arr.stream().mapToInt(Integer::intValue).sum();
        int leftSum = 0;

        for (int i = 0; i < arr.size(); i++) {
            int rightSum = totalSum - leftSum - arr.get(i);
            if (leftSum == rightSum) return "YES";
            leftSum += arr.get(i);
        }
        return "NO";
    }

int sum_up(int* arr, int l, int r){
    int res = 0;
    for (int i = l; i<= r; i++){
        res += arr[i];
    }
    return res;
}

char* balancedSums(int arr_count, int* arr){
    int total_sum = sum_up(arr, 0, arr_count-1);
    int left_sum = 0;
    int right_sum;
    for (int i=0; i<arr_count; i++){
        right_sum = total_sum - left_sum - arr[i];
        if (left_sum == right_sum){
            return "YES";
        }
        left_sum += arr[i];
    }    
    return "NO";
}

sub balancedSums {
    my $arr = shift;
    
    my $total_sum = sum(@$arr);
    my $left_sum = 0;
    foreach my $num (@$arr) {
        my $right_sum = $total_sum - $left_sum - $num;
        return "YES" if $left_sum == $right_sum;
        $left_sum += $num;
    }
    return "NO";  
}

public static String balancedSums(List<Integer> arr) {
  int sum = 0;
  for (int i : arr) {
    sum += i;
  }
  int left = 0;
  for (int i = 0; i < arr.size(); i++) {
    int right = sum - left - arr.get(i);
    if (right == left) {
      return "YES";
    }
    left += arr.get(i);
  }
  return "NO";
}