FB 3 sum0

first solutioin:
#!/usr/bin/env python3

# time complexity = O(n)

arr = [1, -2, 3, 2, 0, -1, 10, -9, 2]
arr_sum = 0
for i in range(0, len(arr)):
    arr_sum += arr[i]

i_sum = 0
r_sum = arr_sum
found = None
for i in range(0, len(arr)):
    i_sum += arr[i]
    r_sum -= arr[i]
    if i_sum == r_sum:
        found = i
        break

if found is None:
    print("no index found that satisfies the given requirement")
else:
    print("array: {}".format(arr))
    print("first: {}".format(arr[:found+1]))
    print("second: {}".format(arr[found+1:]))


->Second solution

 l = [1, -2, 3, 2, 0, -1, 10, -9, 2]
In [16]: for i in xrange(len(l)):
    l_temp += l[i]
    if l_temp == sum(l[i+1:]):
        print "found index = {0}, value={1}".format(i, l[i])
        break
   ....:

out: found index = 5, value=-1