Test results - Codility

Tasks Details

easy

1. TapeEquilibrium

Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|.

Task Score

100%

Correctness

100%

Performance

100%

A non-empty array A consisting of N integers is given. Array A represents numbers on a tape.

Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1].

The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])|

In other words, it is the absolute difference between the sum of the first part and the sum of the second part.

For example, consider array A such that:

A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3

We can split this tape in four places:

P = 1, difference = |3 − 10| = 7

P = 2, difference = |4 − 9| = 5

P = 3, difference = |6 − 7| = 1

P = 4, difference = |10 − 3| = 7

Write a function:

def solution(A)

that, given a non-empty array A of N integers, returns the minimal difference that can be achieved.

For example, given:

A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3

the function should return 1, as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [2..100,000];

each element of array A is an integer within the range [−1,000..1,000].

Solution

Programming language used Python

Time spent on task 21 minutes

Notes

not defined yet

Code: 11:09:35 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 11:09:45 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    pass

Code: 11:11:53 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    녀

Code: 11:12:22 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = []

    for a in A:
        sumarr.append(a[i-1]+a)

Code: 11:12:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [A[0]]
    for a in A:
        sumarr.append(a[i-1]+a)

Code: 11:13:04 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [A[0]]
    for i, a in enumerate(A):
        sumarr.append(a[i-1]+a)

Code: 11:13:37 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [A]
    for i, a in enumerate(A):
        sumarr.append(a[i-1]+a)

Code: 11:13:48 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [0]
    for i, a in enumerate(A):
        sumarr.append(a[i-1]+a)

Code: 11:14:24 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [0]
    for i, a in enumerate(A):
        sumarr.append(smn[i-1]+a)

Code: 11:14:50 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [0]
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for

Code: 11:15:13 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr = [0]
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if

Code: 11:15:37 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if

Code: 11:15:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if

Code: 11:16:01 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if abs()

Code: 11:16:15 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if abs(2*s + )

Code: 11:16:27 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if abs(2*s - totsum)

Code: 11:16:42 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if abs(2*s - totsum) < mindiff:
            mindiff =

Code: 11:17:29 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        if  < mindiff:
            mindiff =

Code: 11:17:49 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    totsum = sumarr[-1]
    for s in sumarr:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:19:15 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)


    totsum = sumarr[-1]
    for s in sumarr:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:19:25 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    delete sumarr[0]
    totsum = sumarr[-1]
    for s in sumarr:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:19:56 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    for s in sumarr:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:22:21 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    for s in sumarr[]:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:22:35 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:22:38 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.036 s

WRONG ANSWER, got 2 expected 1

Code: 11:22:56 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.036 s

WRONG ANSWER, got 2 expected 1

stdout:

Code: 11:23:18 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    p
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:23:29 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.036 s

WRONG ANSWER, got 2 expected 1

stdout:

[3, 1, 5, 5, 8] 8
2
6
2
2

Code: 11:24:24 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:24:35 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        print(i, a, sumarr)
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:24:36 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        print(i, a, sumarr)
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.036 s

WRONG ANSWER, got 2 expected 1

stdout:

0 3 [0]
1 1 [0, 3]
2 2 [0, 3, 1]
3 4 [0, 3, 1, 5]
4 3 [0, 3, 1, 5, 5]
[3, 1, 5, 5, 8] 8
2
6
2
2

Code: 11:25:30 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:28:55 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        print(i, a,)
        sumarr.append(sumarr[i-1]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:29:06 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:29:14 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

stdout:

0 3 [0]
1 1 [0, 3]
2 2 [0, 3, 4]
3 4 [0, 3, 4, 6]
4 3 [0, 3, 4, 6, 10]
[3, 4, 6, 10, 13] 13
7
5
1
7

Code: 11:29:26 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        # print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:29:52 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        # print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    # print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        # print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Code: 11:29:56 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        # print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    # print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        # print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

User test case 1:

[2, 4, 9, 8, 7, 10, 21]

User test case 2:

[1, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

▶

test_data2

✔

0.036 s

OK
function result: 0

Code: 11:30:22 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        # print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    # print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        # print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

User test case 1:

[2, 4, 9, 8, 7, 10, 21]

User test case 2:

[1, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 1

▶

test_data2

✔

0.036 s

OK
function result: 0

Code: 11:30:25 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    sumarr, mindiff = [0], 2e9
    for i, a in enumerate(A):
        # print(i, a, sumarr)
        sumarr.append(sumarr[i]+a)

    del sumarr[0]
    totsum = sumarr[-1]
    # print(sumarr, totsum)
    for s in sumarr[:len(sumarr)-1]:
        diff = abs(2*s - totsum)
        # print(diff)
        if diff < mindiff:
            mindiff = diff

    return mindiff

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

double
two elements

✔

0.036 s

▶

simple_positive
simple test with positive numbers, length = 5

✔

0.036 s

▶

simple_negative
simple test with negative numbers, length = 5

✔

0.036 s

▶

simple_boundary
only one element on one of the sides

✔

0.036 s

▶

small_random
random small, length = 100

✔

0.036 s

▶

small_range
range sequence, length = ~1,000

✔

0.036 s

▶

small
small elements

✔

0.036 s

expand all Performance tests

▶

medium_random1
random medium, numbers from 0 to 100, length = ~10,000

✔

0.048 s

▶

medium_random2
random medium, numbers from -1,000 to 50, length = ~10,000

✔

0.048 s

▶

large_ones
large sequence, numbers from -1 to 1, length = ~100,000

✔

0.152 s

0.156 s

▶

large_random
random large, length = ~100,000

✔

0.172 s

0.168 s

▶

large_sequence
large sequence, length = ~100,000

✔

0.100 s

▶

large_extreme
large test with maximal and minimal values, length = ~100,000

✔

0.172 s

0.168 s

0.140 s