CodeEval - Delta Time - Easy

import sys

def get_bigger(time1,time2):
    for i in range(3):
        if time1[i] > time2[i]:
            return time1,time2
        elif time1[i] < time2[i]:
            return time2,time1
    return time1,time2

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    timestamp=test.split()
    time1=map(int,timestamp[0].split(":"))
    time2=map(int,timestamp[1].split(":"))
    time1,time2=get_bigger(time1,time2)
    val=[0]*3
    for i in range(2,-1,-1):
        val[i]=time1[i]-time2[i]
        if val[i] < 0:
            if i > 0 :
                val[i] += 60
                time1[i-1] -= 1
            else:
                val[i] += 24
    sol=""
    for i in range(3):
        if i > 0:
            sol += ":"
        sol += str(val[i]).zfill(2)
    print sol

test_cases.close()

CodeEval - Compare Points - Easy

import sys

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    cord = map(int, test.split())
    sol = ""
    if cord[1] > cord[3]:
        sol += "S"
    elif cord[1] < cord[3]:
        sol += "N"
    if cord[0] > cord[2]:
        sol += "W"
    elif cord[0] < cord[2]:
        sol += "E"
    if cord[0] == cord[2] and cord[1] == cord[3]:
        sol += "here"
    print sol

test_cases.close()

CodeEval - Details - Easy

import sys

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    rows=test.split(',')
    min=10
    for row in rows:
        counter=0
        for c in row:
            if c == 'Y':
                break
            if c == '.':
                counter += 1
        if counter < min:
            min = counter
            if min == 0 :
                break
        if min == 0 :
            break
    print min
test_cases.close()

CodeEval - Chardonnay or Cabernet - Easy

import sys

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    test=test.split(" | ")
    word=test[1]
    word_char=[0]*26
    for x in word.lower():
        if x.isalpha():
            word_char[ord(x)-ord('a')] += 1
    wine_list=test[0].split()
    sol_list=[]
    for wine in wine_list:
        wine_chars=[0]*26
        for x in wine.lower():
            if x.isalpha():
                wine_chars[ord(x)-ord('a')] += 1
        listed=True
        for i in range(len(wine_chars)):
            if wine_chars[i] < word_char[i]:
                listed=False
                break
        if listed:
            sol_list.append(wine)
    sol=""
    for i in range(len(sol_list)):
        if i>0 :
            sol += " "
        sol += sol_list[i]
    if sol:
        print sol
    else:
        print False

test_cases.close()

CodeEval - Minimum Distance - Easy

import sys

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    arr = test.split()
    n = int(arr[0])
    sum = 0
    for i in range(n):
        sum += int(arr[i+1])
    avg = int (sum / n)
    dist = 0
    for i in range(n):
        dist += abs(avg-int(arr[i+1]))
    avgInc = avg + 1
    while True:
        sumDist = 0
        for i in range(n):
            sumDist += abs(avgInc-int(arr[i+1]))
        if dist < sumDist :
            break
        dist = sumDist
        avgInc += 1
    avgDec = avg - 1
    while True:
        sumDist = 0
        for i in range(n):
            sumDist += abs(avgDec-int(arr[i+1]))
        if dist < sumDist :
            break
        dist = sumDist  
        avgDec -= 1
    print dist

test_cases.close()

CodeEval - Clean up the words - Easy

import sys

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    sol=""
    for char in test:
        if char.isalpha():
            sol += char
        else :
            sol += " "
    sol = sol.strip()
    words = sol.split()
    sol = ""
    for i in range(len(words)):
        if i > 0 :
            sol += " "
        sol += words[i].lower()
    print sol

test_cases.close()

CodeEval - Stepwise word - Easy

import sys

test_cases = open(sys.argv[1], 'r')
for test in test_cases:
    words=test.split()
    max_word=""
    max_length=0
    for i in range(len(words)):
        word_length=len(words[i])
        if word_length > max_length:
            max_length = word_length
            max_word = words[i]
    sol=""
    for i in range(max_length):
        if i> 0 :
            sol += " "
        for j in range(i):
            sol += "*"
        sol += max_word[i]
    print sol

test_cases.close()