gbazilio

find . -name "._*" -exec rm -rf {} \;

gbazilio

def solution(N):
    if N < 0: return 0

    binary_string = bin(N)[2:]

    max_gap_count = current_gap_count = 0
    for index in range(len(binary_string)):
        if binary_string[index] == "0":
            current_gap_count += 1
        else:

gbazilio

def solution(A, K):
    A_length = len(A)

    new_A_array = [0] * A_length
    for index in range(A_length):
        shift_index = (index+K) % A_length
        new_A_array[shift_index] = A[index]

    return new_A_array

gbazilio

def solution(A):
    A = sorted(A)
    for index in range(0, len(A), 2):
        next_index = index+1
        if next_index >= len(A) or A[index] != A[index+1]:
            return A[index]

gbazilio

def solution(A):
    A_length = len(A)
    array_sum = sum(A)
    complete_sequence_sum = (A_length * (A_length + 1) / 2) + (A_length + 1)

    return complete_sequence_sum - array_sum

gbazilio

def solution(X, Y, D):
    return int(math.ceil((Y - X) / float(D)))

gbazilio

def solution(A):
    sum_of_part_two = sum(A)
    min_difference = None
    sum_of_part_one = 0
    for i in xrange(1, len(A)):
        sum_of_part_one += A[i-1]
        sum_of_part_two -= A[i-1]
        difference = abs(sum_of_part_one - sum_of_part_two)

        if (min_difference == None):

gbazilio

def solution(A):
    n = len(A)
    A_sum = sum(set(A))
    ideal_sum = n*(n+1)/2
    return 1 if A_sum == ideal_sum else 0

gbazilio

def solution(A):    
    count_length = len(A)
    count_array = [0] * (count_length + 1)

    for value in A:
        if value > 0 and value <= count_length:
            count_array[value-1] += 1

    for index in xrange(len(count_array)):
        if count_array[index] == 0:

gbazilio

def solution(X, A):
    count_array = [0] * (X)
    leaves = 0
    for index in xrange(len(A)):
        if count_array[A[index] - 1] == 0:
            count_array[A[index] - 1] = 1
            leaves += 1
        if leaves == X:
            return index
    return -1