Test results - Codility

Tasks Details

medium

1. MissingInteger

Find the smallest positive integer that does not occur in a given sequence.

Task Score

100%

Correctness

100%

Performance

100%

This is a demo task.

Write a function:

def solution(A)

that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.

For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

Given A = [−1, −3], the function should return 1.

Write an efficient algorithm for the following assumptions:

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

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

Solution

Programming language used Python

Time spent on task 7 minutes

Notes

not defined yet

Code: 08:16:48 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:17:11 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:17:39 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

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

import collections

def solution(A):
    max_num =

Code: 08:17: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")

import collections

def solution(A):
    max_num = -1

Code: 08:18:19 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")

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num

Code: 08:18:49 UTC, py, autosave

show code in pop-up

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

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

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range()

Code: 08:19:12 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")

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        print(j)

Code: 08:19:27 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

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

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        print(j)

Analysis

expand all Example tests

▶

example1
first example test

✘

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:

▶

example2
second example test

✘

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:

1
2
3

▶

example3
third example test

✘

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.

Code: 08:21:19 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")

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        =

Code: 08:21:39 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")

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

Code: 08:21:52 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")

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

Analysis

expand all Example tests

▶

example1
first example test

✔

0.036 s

▶

example2
second example test

✘

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.

▶

example3
third example test

✘

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.

Code: 08:22:09 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")

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

Code: 08:22:39 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 21 22

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

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

    if max_num <= 0:
        return 1
    else:
        return max_num +

Code: 08:22:42 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 21 22

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

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

    if max_num <= 0:
        return 1
    else:
        return max_num + 1

Analysis

expand all Example tests

▶

example1
first example test

✔

0.036 s

▶

example2
second example test

✔

0.036 s

▶

example3
third example test

✔

0.036 s

Code: 08:22:46 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 21 22

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

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

    if max_num <= 0:
        return 1
    else:
        return max_num + 1

Analysis

expand all Example tests

▶

example1
first example test

✔

0.036 s

▶

example2
second example test

✔

0.036 s

▶

example3
third example test

✔

0.036 s

Code: 08:22:49 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 21 22

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

import collections

def solution(A):
    max_num = -1
    count_dict = collections.defaultdict(int)

    for i in A:
        max_num = max(i, max_num)
        count_dict[i] += 1
    
    for j in range(1, max_num + 1):
        if count_dict[j] == 0:
            return j

    if max_num <= 0:
        return 1
    else:
        return max_num + 1

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N) or O(N * log(N))

expand all Example tests

▶

example1
first example test

✔

0.036 s

▶

example2
second example test

✔

0.036 s

▶

example3
third example test

✔

0.036 s

expand all Correctness tests

▶

extreme_single
a single element

✔

0.036 s

▶

simple
simple test

✔

0.044 s

0.036 s

▶

extreme_min_max_value
minimal and maximal values

✔

0.036 s

▶

positive_only
shuffled sequence of 0...100 and then 102...200

✔

0.036 s

▶

negative_only
shuffled sequence -100 ... -1

✔

0.036 s

expand all Performance tests

▶

medium
chaotic sequences length=10005 (with minus)

✔

0.048 s

0.052 s

▶

large_1
chaotic + sequence 1, 2, ..., 40000 (without minus)

✔

0.172 s

▶

large_2
shuffled sequence 1, 2, ..., 100000 (without minus)

✔

0.204 s

0.196 s

▶

large_3
chaotic + many -1, 1, 2, 3 (with minus)

✔

0.160 s