Run #a881520b

completed

Score

100% (4/4)

Runtime

3μs

vs Previous

No change vs parent

Tied for best

Same as parent

Solution Lineage

Current100%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 []
    
    # Using list comprehension for optimization
    return [input[i] - input[i - 1] if i > 0 else input[0] for i in range(len(input))]

Compare with Champion

Score Difference

Tied

Runtime Advantage

1μs slower

Code Size

6 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 # Using list comprehension for optimization5 previous = input[0]
6 return [input[i] - input[i - 1] if i > 0 else input[0] for i in range(len(input))]6 for current in input[1:]:
77 result.append(current - previous)
88 previous = current
99 return result
Your Solution
100% (4/4)3μs
1def solve(input):
2    if not input:
3        return []
4    
5    # Using list comprehension for optimization
6    return [input[i] - input[i - 1] if i > 0 else input[0] for i in range(len(input))]
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