Question: https://codility.com/demo/take-sample-test/equi

Question Name: Equi

The expected worst-case space complexity could be less than required.

1 2 3 4 5 6 7 8 9 10 11 12 13 | def solution(A): heading = 0 # The sum of A[0] + A[1] + ... + A[P-1] tailing = sum(A) # The sum of A[P] + A[P+1] + ... + A[N-2] + A[N-1] for index in xrange(len(A)): tailing -= A[index] # The sum of A[P+1] + ... + A[N-2] + A[N-1] if heading == tailing: # A[0] + A[1] + ... + A[P-1] == A[P+1] + ... + A[N-2] + A[N-1] return index heading += A[index] else: # No equilibrium is found. return -1 |

## One thought on “Solution to Equi by codility”