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

  • ollibolli
     + 4 comments

    I had a similar idea, but yours is way better. Helped me figure out why mine was so slow:

    def solve(a):
    # Complete this function
    if len(a) == 1:
        return "YES"
    for i in range(1, int(len(a)+1/2)):
        left = sum(a[:i])
        right = sum(a[i+1:])
        if left == right:
            return "YES"
            break
    else:
        return "NO"

    Instead of computing the sum each time, just subtract. Way more efficient. Thank you for sharing.