Test results - Codility

Tasks Details

easy

1. MaxSliceSum

Find a maximum sum of a compact subsequence of array elements.

Task Score

100%

Correctness

100%

Performance

100%

A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P ≤ Q < N, is called a slice of array A. The sum of a slice (P, Q) is the total of A[P] + A[P+1] + ... + A[Q].

Write a function:

def solution(A)

that, given an array A consisting of N integers, returns the maximum sum of any slice of A.

For example, given array A such that:

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

the function should return 5 because:

(3, 4) is a slice of A that has sum 4,

(2, 2) is a slice of A that has sum −6,

(0, 1) is a slice of A that has sum 5,

no other slice of A has sum greater than (0, 1).

Write an efficient algorithm for the following assumptions:

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

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

the result will be an integer within the range [−2,147,483,648..2,147,483,647].

Solution

Programming language used Python

Time spent on task 19 minutes

Notes

not defined yet

Task timeline

Code: 08:57:40 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: 08:57:50 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: 08:58:21 UTC, py, autosave

show code in pop-up

1 2 3

def solution(A):
    for num in A:
        print9n

Code: 08:58:28 UTC, py, verify, result: Failed

show code in pop-up

1 2 3

def solution(A):
    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 08:58:41 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

def solution(A):

    

    for num in A:
        print(num)

Code: 08:59:12 UTC, py, autosave

show code in pop-up

1 2 3 4

def solution(A):

    for num in A:
        print(num)

Code: 08:59:55 UTC, py, autosave

show code in pop-up

1 2 3 4 5

def solution(A):


    for num in A:
        print(num)

Code: 09:00:14 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

def solution(A):

    temp_add = []
    temp_count = 0

    for num in A:
        print(num)

Code: 09:00:44 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(A):

    temp_add = []
    temp_count = 0

    for num in A:
        temp_count += num
        
        if

Code: 09:00:55 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(A):

    temp_add = []
    temp_count = 0

    for num in A:
        temp_count += num
        
        if num < 0:

Code: 09:01:06 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

def solution(A):

    temp_add = []
    temp_count = 0

    for num in A:
        temp_count += num

Code: 09:01:36 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(A):

    temp_add = []
    temp_count = 0

    for num in A:
        temp_count += num
        
        if te

Code: 09:01:47 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(A):

    temp_add = []
    temp_count = 0

    for num in A:
        temp_count += num

Code: 09:02:26 UTC, py, autosave

show code in pop-up

1 2 3 4

def solution(A):

Code: 09:02:41 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5

def solution(A):
    
    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:02:50 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

def solution(A):
    
    for num in A:
        print(num)

Code: 09:03:59 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6

def solution(A):
    
    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:05:07 UTC, py, autosave

show code in pop-up

1 2 3 4

def solution(A):

Code: 09:05:33 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5

def solution(A):
    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:06:40 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5

def solution(A):
    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:06:42 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

def solution(A):
    
    for num in A:
        print(num)

Code: 09:06:57 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

def solution(A):

    add = 0

    for num in A:
        print(num)

Code: 09:07:07 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

def solution(A):

    add = 0

    for num in A:

Code: 09:07:19 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(A):

    add_num = 0

    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:07:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

def solution(A):

    add_num = 0

    for num in A:
        add_num = 0
        print(num)

Code: 09:07:46 UTC, py, autosave

show code in pop-up

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

def solution(A):

    add_num = 0

    for num in A:
        add_num += num 
        

        print(num)

Code: 09:07:57 UTC, py, autosave

show code in pop-up

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

def solution(A):

    add_num = 0

    for num in A:
        add_num += num 
        add_num

        print(num)

Code: 09:08:21 UTC, py, autosave

show code in pop-up

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

def solution(A):

    add_num = - 1000001

    for num in A:
        add_num += num 
        add_num = max(add_num, )

        print(num)

Code: 09:08:34 UTC, py, autosave

show code in pop-up

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

def solution(A):

    add_num = - 10000001

    for num in A:
        add_num += num 
        add_num = max(add_num, )

        print(num)

Code: 09:08:46 UTC, py, autosave

show code in pop-up

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

def solution(A):

    add_num = - 1000001

    for num in A:
        add_num += num 
        add_num = max(add_num, )

        print(num)

Code: 09:09:18 UTC, py, autosave

show code in pop-up

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

def solution(A):

    add_num = - 1000001

    for num in A:
        add_num += num 
        add_num = max(add, )

        print(num)

Code: 09:09:35 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

def solution(A):

    add_num = - 1000001

    for num in A:

Code: 09:09:59 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

def solution(A):

    add_num = - 1000001

    for num in A:

Code: 09:10:56 UTC, py, autosave

show code in pop-up

1 2

def solution(A):

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

show code in pop-up

1 2 3 4 5 6 7

def solution(A):
    
    add_num = 0


    for num in A:
        print()

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

show code in pop-up

1 2 3 4 5 6 7

def solution(A):
    
    add_num = 0


    for num in A:
        print(num)

Code: 09:11:57 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7

def solution(A):
    
    add_num = 0


    for num in A:
        print(num)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:12:25 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

def solution(A):
    
    add_num = 0
    add_num_list 

    for num in A:
        print(num)

Code: 09:12:50 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append()

Code: 09:13:18 UTC, py, autosave

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append()

        if add_num < 0:
            add_num = 0
        
    print(add_num_list)

Code: 09:13:19 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append()

        if add_num < 0:
            add_num = 0
        
    print(add_num_list)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 129, in <module>
    main()
  File "exec.py", line 91, in main
    result = solution( A )
  File "/tmp/solution.py", line 8, in solution
    add_num_list.append()
TypeError: append() takes exactly one argument (0 given)

Code: 09:14:23 UTC, py, autosave

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_)

        if add_num < 0:
            add_num = 0
        
    print(add_num_list)

Code: 09:14:30 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    print(add_num_list)

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

[3, 5, -1, 4, 4]

Code: 09:14:47 UTC, py, autosave

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    print(max(add_num_list))

Code: 09:14:51 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    print(max(add_num_list))

Analysis

expand all Example tests

▶

example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 09:15:02 UTC, py, verify, result: Passed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

Analysis

expand all Example tests

▶

example

✔

0.040 s

Code: 09:15:10 UTC, py, verify, result: Passed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

User test case 1:

[-1]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: -1

Code: 09:15:17 UTC, py, autosave

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

Code: 09:15:21 UTC, py, verify, result: Passed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

User test case 1:

[-1]

User test case 2:

[-1, -8]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: -1

▶

test_data2

✔

0.036 s

OK
function result: -1

Code: 09:15:45 UTC, py, verify, result: Passed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

User test case 1:

[-1]

User test case 2:

[-1, -8]

User test case 3:

[1, -8, 9, -7, 19]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: -1

▶

test_data2

✔

0.036 s

OK
function result: -1

▶

test_data3

✔

0.036 s

OK
function result: 21

Code: 09:15:59 UTC, py, verify, result: Passed

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

User test case 1:

[-1]

User test case 2:

[-1, -8]

User test case 3:

[1, -8, 9, -7, 19]

Analysis

expand all Example tests

▶

example

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: -1

▶

test_data2

✔

0.036 s

OK
function result: -1

▶

test_data3

✔

0.036 s

OK
function result: 21

Code: 09:16:02 UTC, py, final, score: 100

show code in pop-up

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

def solution(A):
    
    add_num = 0
    add_num_list = []

    for num in A:
        add_num += num
        add_num_list.append(add_num)

        if add_num < 0:
            add_num = 0
        
    return max(add_num_list)

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example

✔

0.036 s

expand all Correctness tests

▶

one_element

✔

0.036 s

▶

two_elements

✔

0.036 s

▶

three_elements

✔

0.036 s

10.

0.036 s

11.

0.036 s

12.

0.036 s

13.

0.036 s

14.

0.036 s

15.

0.036 s

16.

0.036 s

17.

0.036 s

18.

0.036 s

19.

0.036 s

20.

0.036 s

21.

0.036 s

22.

0.036 s

23.

0.036 s

24.

0.036 s

25.

0.036 s

26.

0.036 s

27.

0.036 s

▶

simple

✔

0.036 s

▶

extreme_minimum

✔

0.036 s

▶

fifty_random

✔

0.036 s

▶

neg_const

✔

0.036 s

▶

pos_const

✔

0.036 s

expand all Performance tests

▶

high_low_1Kgarbage

✔

0.036 s

▶

1Kgarbage_high_low

✔

0.036 s

▶

growing_saw

✔

0.036 s

▶

blocks

✔

0.164 s

▶

growing_negative

✔

0.276 s