Test results - Codility

Tasks Details

easy

1. PermCheck

Check whether array A is a permutation.

Task Score

100%

Correctness

100%

Performance

100%

A non-empty array A consisting of N integers is given.

A permutation is a sequence containing each element from 1 to N once, and only once.

For example, array A such that:

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

is a permutation, but array A such that:

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

is not a permutation, because value 2 is missing.

The goal is to check whether array A is a permutation.

Write a function:

def solution(A)

that, given an array A, returns 1 if array A is a permutation and 0 if it is not.

For example, given array A such that:

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

the function should return 1.

Given array A such that:

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

the function should return 0.

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..1,000,000,000].

Solution

Programming language used Python

Time spent on task 14 minutes

Notes

not defined yet

Code: 04:56: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: 04:57:14 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: 04:57:25 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")

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

Code: 05:06:51 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")

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

Code: 05:07:05 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
    A.sort()
    for i in range(len(A)):
        
    pass

Code: 05:07:26 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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=
    pass

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

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=i:
            return i
    pass

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

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=i:
            return i
    return 1

Code: 05:07:56 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=i:
            return i
    return 1

Analysis

expand all Example tests

▶

example1
the first example test

✘

WRONG ANSWER
got 0 expected 1

0.040 s

WRONG ANSWER, got 0 expected 1

▶

example2
the second example test

✔

0.040 s

Code: 05:08:10 UTC, py, verify, result: Failed

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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=i:
            print(i,A[i]+1)
            return i
    return 1

Analysis

expand all Example tests

▶

example1
the first example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

stdout:

0 2

▶

example2
the second example test

✔

0.036 s

stdout:

0 2

Code: 05:08:34 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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=i:
            print(i+,A[i]+1)
            return i
    return 1

Code: 05:08:44 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
    A.sort()
    for i in range(len(A)):
        if A[i]+1!=i+1:
            print(i+1,A[i]+1)
            return i
    return 1

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

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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            print(i+1,A[i])
            return i
    return 1

Analysis

expand all Example tests

▶

example1
the first example test

✔

0.036 s

▶

example2
the second example test

✘

WRONG ANSWER
got 1 expected 0

0.036 s

WRONG ANSWER, got 1 expected 0

stdout:

2 3

Code: 05:09:39 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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            print(i+1,A[i])
            return 0
    return 1

Code: 05:09:40 UTC, py, verify, result: Passed

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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            print(i+1,A[i])
            return 0
    return 1

Analysis

expand all Example tests

▶

example1
the first example test

✔

0.036 s

▶

example2
the second example test

✔

0.036 s

stdout:

2 3

Code: 05:09:55 UTC, py, verify, result: Passed

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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            print(i+1,A[i])
            return 0
    return 1

Analysis

expand all Example tests

▶

example1
the first example test

✔

0.036 s

▶

example2
the second example test

✔

0.036 s

stdout:

2 3

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

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            return 0
    return 1

Code: 05:10:11 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            return 0
    return 1

Analysis

expand all Example tests

▶

example1
the first example test

✔

0.036 s

▶

example2
the second example test

✔

0.036 s

Code: 05:10:13 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# 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
    A.sort()
    for i in range(len(A)):
        if A[i]!=i+1:
            return 0
    return 1

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

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

expand all Example tests

▶

example1
the first example test

✔

0.036 s

▶

example2
the second example test

✔

0.036 s

expand all Correctness tests

▶

extreme_min_max
single element with minimal/maximal value

✔

0.036 s

▶

single
single element

✔

0.036 s

▶

double
two elements

✔

0.036 s

▶

antiSum1
total sum is correct, but it is not a permutation, N <= 10

✔

0.036 s

▶

small_permutation
permutation + one element occurs twice, N = ~100

✔

0.036 s

▶

permutations_of_ranges
permutations of sets like [2..100] for which the anwsers should be false

✔

0.036 s

expand all Performance tests

▶

medium_permutation
permutation + few elements occur twice, N = ~10,000

✔

0.048 s

▶

antiSum2
total sum is correct, but it is not a permutation, N = ~100,000

✔

0.128 s

0.140 s

▶

large_not_permutation
permutation + one element occurs three times, N = ~100,000

✔

0.168 s

0.176 s

▶

large_range
sequence 1, 2, ..., N, N = ~100,000

✔

0.136 s

▶

extreme_values
all the same values, N = ~100,000

✔

0.036 s

0.120 s

0.036 s

▶

various_permutations
all sequences are permutations

✔

0.036 s

0.048 s

0.140 s

0.184 s