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 95 minutes

Notes

not defined yet

Task timeline

Code: 04:42:49 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) {
        // Implement your solution here
    }
}

Code: 04:43:02 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):
    # Implement your solution here
    pass

Code: 04:46:13 UTC, py, verify, result: Failed

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):
    # Implement your solution here
    pass

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.012 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

▶

example1
example, answer is zero, length=4

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.012 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

Code: 06:15:45 UTC, py, autosave

show code in pop-up

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

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

def solution(A):
    # Implement your solution here
    print(A)
    A= sorted(A)
    print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
        else:
            return 0 
        
solution([10, 2, 5, 1, 8, 20])

Code: 06:15:46 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

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

def solution(A):
    # Implement your solution here
    print(A)
    A= sorted(A)
    print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
        else:
            return 0 
        
solution([10, 2, 5, 1, 8, 20])

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✘

WRONG ANSWER
got 0 expected 1

0.012 s

WRONG ANSWER, got 0 expected 1

stdout:

[10, 2, 5, 1, 8, 20]
[1, 2, 5, 8, 10, 20]
[10, 2, 5, 1, 8, 20]
[1, 2, 5, 8, 10, 20]

▶

example1
example, answer is zero, length=4

✔

0.012 s

stdout:

[10, 2, 5, 1, 8, 20]
[1, 2, 5, 8, 10, 20]
[10, 50, 5, 1]
[1, 5, 10, 50]

Code: 06:15:56 UTC, py, autosave

show code in pop-up

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

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

def solution(A):
    # Implement your solution here
    print(A)
    A= sorted(A)
    #print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
        else:
            return 0 
        
solution([10, 2, 5, 1, 8, 20])

Code: 06:16:01 UTC, py, verify, result: Failed

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")

def solution(A):
    # Implement your solution here
    A= sorted(A)
    #print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
        else:
            return 0 
        
solution([10, 2, 5, 1, 8, 20])

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✘

WRONG ANSWER
got 0 expected 1

0.012 s

WRONG ANSWER, got 0 expected 1

▶

example1
example, answer is zero, length=4

✔

0.012 s

Code: 06:16:30 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")

def solution(A):
    # Implement your solution here
    A= sorted(A)
    #print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
        
            return 0 
        
solution([10, 2, 5, 1, 8, 20])

Code: 06:16:38 UTC, py, verify, result: Passed

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")

def solution(A):
    # Implement your solution here
    A= sorted(A)
    #print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
    
    return 0 
        
solution([10, 2, 5, 1, 8, 20])

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.012 s

▶

example1
example, answer is zero, length=4

✔

0.012 s

Code: 06:16:44 UTC, py, verify, result: Passed

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")

def solution(A):
    # Implement your solution here
    A= sorted(A)
    #print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
    
    return 0 
        
solution([10, 2, 5, 1, 8, 20])

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.012 s

▶

example1
example, answer is zero, length=4

✔

0.012 s

Code: 06:16:47 UTC, py, final, score: 100

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")

def solution(A):
    # Implement your solution here
    A= sorted(A)
    #print(A)
    for i in range(2,len(A)):
        if (A[i-2] + A[i-1]) > A[i]:
            return 1
    
    return 0 
        
solution([10, 2, 5, 1, 8, 20])

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.012 s

▶

example1
example, answer is zero, length=4

✔

0.012 s

expand all Correctness tests

▶

extreme_empty
empty sequence

✔

0.012 s

▶

extreme_single
1-element sequence

✔

0.012 s

▶

extreme_two_elems
2-element sequence

✔

0.012 s

▶

extreme_negative1
three equal negative numbers

✔

0.012 s

▶

extreme_arith_overflow1
overflow test, 3 MAXINTs

✔

0.012 s

▶

extreme_arith_overflow2
overflow test, 10 and 2 MININTs

✔

0.012 s

▶

extreme_arith_overflow3
overflow test, 0 and 2 MAXINTs

✔

0.012 s

▶

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

✔

0.012 s

▶

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

✔

0.012 s

▶

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

✔

0.012 s

expand all Performance tests

▶

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

✔

0.016 s

0.012 s

▶

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

✔

0.028 s

0.012 s

▶

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

✔

0.060 s

0.012 s

▶

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

✔

0.076 s

0.012 s

▶

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

✔

0.068 s

0.012 s

▶

large_negative3
sequence of -1 value, length=100K

✔

0.056 s

0.012 s