Test results - Codility

Tasks Details

easy

1. Triangle

Determine whether a triangle can be built from a given set of edges.

Task Score

100%

Correctness

100%

Performance

100%

An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 ≤ P < Q < R < N and:

A[P] + A[Q] > A[R],

A[Q] + A[R] > A[P],

A[R] + A[P] > A[Q].

For example, consider array A such that:

A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20

Triplet (0, 2, 4) is triangular.

Write a function:

def solution(A)

that, given an array A consisting of N integers, returns 1 if there exists a triangular triplet for this array and returns 0 otherwise.

For example, given array A such that:

A[0] = 10 A[1] = 2 A[2] = 5 A[3] = 1 A[4] = 8 A[5] = 20

the function should return 1, as explained above. Given array A such that:

A[0] = 10 A[1] = 50 A[2] = 5 A[3] = 1

the function should return 0.

Write an efficient algorithm for the following assumptions:

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

each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

Solution

Programming language used Python

Time spent on task 4 minutes

Notes

not defined yet

Task timeline

Code: 16:18:15 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: 16:18: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 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i] != 0]
        
        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Code: 16:18:44 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i] > 0]
        
        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Code: 16:19:03 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]
        
        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Code: 16:19:05 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]
        
        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

Code: 16:19:19 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]
        
        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

User test case 1:

[-1, -1, -1]

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

expand all User tests

▶

test_data1

✘

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 42, in solution
    if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
IndexError: list index out of range

Code: 16:20:17 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]        
        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Code: 16:20:28 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]

        if len(num)

        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Code: 16:21:07 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]

        if len(num) <

        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Code: 16:21: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 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]

        if len(num) < 3:
            return 0

        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

User test case 1:

[-1, -1, -1]

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 0

Code: 16:21:21 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]

        if len(num) < 3:
            return 0

        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

User test case 1:

[-1, -1, -1]

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 0

Code: 16:21:24 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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51

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

def next_perm(a):
    i = len(a)-1

    while i > 0 and a[i-1] >= a[i]:
        i -= 1
    
    if i <= 0:
        return False
    
    j = len(a)-1

    while a[i-1] >= a[j]:
        j -= 1
    
    a[i-1], a[j] = a[j], a[i-1]

    j = len(a)-1

    while i < j:
        a[i], a[j] = a[j], a[i]
        i += 1
        j -= 1

    return True


def solution(A):
    
    if len(A) < 3:
        return 0

    N = len(A)
    _A = sorted(A)
    p = [0]*(N-3) + [1]*3

    while True:
        num = [p[i]*_A[i] for i in range(N) if p[i]*_A[i] > 0]

        if len(num) < 3:
            return 0

        if num[0]+num[1] > num[2] and num[0]+num[2] > num[1] and num[1]+num[2] > num[0]:
            return 1

        if not next_perm(p):
            break

    return 0

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N*log(N))

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.036 s

▶

example1
example, answer is zero, length=4

✔

0.036 s

expand all Correctness tests

▶

extreme_empty
empty sequence

✔

0.036 s

0.044 s

▶

extreme_single
1-element sequence

✔

0.036 s

0.040 s

0.036 s

▶

extreme_two_elems
2-element sequence

✔

0.036 s

▶

extreme_negative1
three equal negative numbers

✔

0.036 s

▶

extreme_arith_overflow1
overflow test, 3 MAXINTs

✔

0.036 s

▶

extreme_arith_overflow2
overflow test, 10 and 2 MININTs

✔

0.036 s

▶

extreme_arith_overflow3
overflow test, 0 and 2 MAXINTs

✔

0.036 s

▶

medium1
chaotic sequence of values from [0..100K], length=30

✔

0.036 s

▶

medium2
chaotic sequence of values from [0..1K], length=50

✔

0.036 s

▶

medium3
chaotic sequence of values from [0..1K], length=100

✔

0.036 s

expand all Performance tests

▶

large1
chaotic sequence with values from [0..100K], length=10K

✔

0.052 s

0.036 s

0.040 s

0.036 s

▶

large2
1 followed by an ascending sequence of ~50K elements from [0..100K], length=~50K

✔

0.092 s

0.036 s

▶

large_random
chaotic sequence of values from [0..1M], length=100K

✔

0.184 s

0.036 s

▶

large_negative
chaotic sequence of negative values from [-1M..-1], length=100K

✔

0.184 s

0.036 s

▶

large_negative2
chaotic sequence of negative values from [-10..-1], length=100K

✔

0.160 s

0.036 s

▶

large_negative3
sequence of -1 value, length=100K

✔

0.144 s

0.036 s