We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Search
  4. Sherlock and Array
  5. Discussions

Sherlock and Array

  • safee7
     + 0 comments

    Here is the solution in Py3

    #!/bin/python3

import math
import os
import random
import re
import sys

# 
#Complete the 'balancedSums' function below.
#
# The function is expected to return a STRING.
# The function accepts INTEGER_ARRAY arr as parameter.
#
for t in range(int(input())):
    n = int(input())
    a = [int(b) for b in input().split()]
    s = sum(a)
    count = 0
    for i in range(n):
        if 2*count == s-a[i]:
            print("YES")
            break
        count += a[i]
    else:
        print("NO")