gbazilio

def solution(N, A):
    max_counter = last_max_counter = 0
    counters = [0] * N

    for k in xrange(len(A)):
        current_counter = A[k]

        if current_counter == N+1:
            last_max_counter = max_counter
        else:

gbazilio

def solution(A):
    passing_cars = 0
    east_cars = 0

    for index in xrange(len(A)):
        if A[index] == 1:
            passing_cars += east_cars
        else:
            east_cars += 1

gbazilio

def solution(S, P, Q):
    m_size = len(P)
    count_size = len(S) + 1
    A = [0] * count_size
    C = [0] * count_size
    G = [0] * count_size

    for i in xrange(len(S)):
        nucleotide = S[i]
        A[i + 1] += A[i] + (1 if nucleotide == 'A' else 0)