Run #7b1e508d

completed

Score

100% (4/4)

Runtime

6μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%Same as parent
3933d6fd100%Same as parent
ab373fe2100%Same as parent
72e0a3dd100%Same as parent
ef8ec475100%Same as parent
7774af03100%Same as parent
1906c4f0100%Same as parent
a881520b100%Same as parent
ff533f20100%Improved from parent
c07852e925%Regression from parent
6c4e319f100%Same as parent
0139cffd100%Same as parent
5fd7278e100%Same as parent
2fac06cd100%First in chain

Code

def solve(input):
    if not input:
        return []
        
    n = len(input)
    result = [0] * n
    result[0] = input[0]
    prev = input[0]
    for i in range(1, n):
        current = input[i]
        result[i] = current - prev
        prev = current
    return result

Compare with Champion

Score Difference

Tied

Runtime Advantage

4μs slower

Code Size

13 vs 9 lines

#Your Solution#Champion
1def solve(input):1def solve(input):
2 if not input:2 if not input:
3 return []3 return []
4 4 result = [input[0]]
5 n = len(input)5 previous = input[0]
6 result = [0] * n6 for current in input[1:]:
7 result[0] = input[0]7 result.append(current - previous)
8 prev = input[0]8 previous = current
9 for i in range(1, n):9 return result
10 current = input[i]10
11 result[i] = current - prev11
12 prev = current12
13 return result13
Your Solution
100% (4/4)6μs
1def solve(input):
2    if not input:
3        return []
4        
5    n = len(input)
6    result = [0] * n
7    result[0] = input[0]
8    prev = input[0]
9    for i in range(1, n):
10        current = input[i]
11        result[i] = current - prev
12        prev = current
13    return result
Champion
100% (4/4)2μs
1def solve(input):
2    if not input:
3        return []
4    result = [input[0]]
5    previous = input[0]
6    for current in input[1:]:
7        result.append(current - previous)
8        previous = current
9    return result