Solution for Cassidoo Newsletter (July 19) in Python

subarraySum.py

#!/bin/python3

def subarraySum(arr, n):
    arr_len = len(arr)
    count = 0
    for x in range(0, arr_len - 1):
        total = arr[x]
        for y in range(x+1, arr_len):
            total += arr[y]
            if total == n:
                count += 1

    return -1 if count==0 else count


def subarraySum2(arr, n):
    count = 0
    for x in range(len(arr)-1):
        for y in range(x+1, len(arr)):
            if sum(arr[x:y+1]) == n:
                count += 1
    return -1 if count==0 else count

if __name__ == '__main__':
    arr = [ 10, 2, -2, -20, 10 ]
    n = -10

    print(subarraySum(arr, n))
    print(subarraySum2(arr, n))