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:

class Solution { public int solution(int[] 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 C#

Time spent on task 4 minutes

Notes

not defined yet

Code: 05:15:38 UTC, cs, 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

using System;

class Solution {
    public int solution(int[] A) {
        
        Array.Sort(A);
        
        int N = A.Length;
        long l;
        
        for(int i = 0; i < (N - 2); i++)
        {
            l = A[i] + A[i + 1];
            Console.WriteLine("l : " + l);
            if(l > A[i + 2])
            {
                return 1;
            }
        }
        
        return 0;
    }
}

User test case 1:

[2147483647, 2147483647, 2147483647]

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.064 s

stdout:

l : 3
l : 7
l : 13

▶

example1
example, answer is zero, length=4

✔

0.064 s

stdout:

l : 6
l : 15

expand all User tests

▶

test_data1

✔

0.065 s

OK
function result: 0

stdout:

l : -2

Code: 05:17:10 UTC, cs, 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 18 19 20 21 22 23 24

using System;

class Solution {
    public int solution(int[] A) {
        
        Array.Sort(A);
        
        int N = A.Length;
        long l, m;
        
        for(int i = 0; i < (N - 2); i++)
        {
            l = A[i];
            m = A[i + 1]
            Console.WriteLine("l + m : " + l + m);
            if(l + m > A[i + 2])
            {
                return 1;
            }
        }
        
        return 0;
    }
}

Analysis

Compile error

Compilation failed: 1 error(s), 0 warnings
Solution.cs(15,12): error CS1525: Unexpected symbol `Console'

Code: 05:17:26 UTC, cs, 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 18 19 20 21 22 23 24

using System;

class Solution {
    public int solution(int[] A) {
        
        Array.Sort(A);
        
        int N = A.Length;
        long l, m;
        
        for(int i = 0; i < (N - 2); i++)
        {
            l = A[i];
            m = A[i + 1]
            Console.WriteLine("l + m : " + (l + m));
            if(l + m > A[i + 2])
            {
                return 1;
            }
        }
        
        return 0;
    }
}

Analysis

Compile error

Compilation failed: 1 error(s), 0 warnings
Solution.cs(15,12): error CS1525: Unexpected symbol `Console'

Code: 05:17:37 UTC, cs, 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

using System;

class Solution {
    public int solution(int[] A) {
        
        Array.Sort(A);
        
        int N = A.Length;
        long l, m;
        
        for(int i = 0; i < (N - 2); i++)
        {
            l = A[i];
            m = A[i + 1];
            Console.WriteLine("l + m : " + (l + m));
            if(l + m > A[i + 2])
            {
                return 1;
            }
        }
        
        return 0;
    }
}

User test case 1:

[2147483647, 2147483647, 2147483647]

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.064 s

stdout:

l + m : 3
l + m : 7
l + m : 13

▶

example1
example, answer is zero, length=4

✔

0.064 s

stdout:

l + m : 6
l + m : 15

expand all User tests

▶

test_data1

✔

0.064 s

OK
function result: 1

stdout:

l + m : 4294967294

Code: 05:17:57 UTC, cs, 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

using System;

class Solution {
    public int solution(int[] A) {
        
        Array.Sort(A);
        
        int N = A.Length;
        long l, m;
        
        for(int i = 0; i < (N - 2); i++)
        {
            l = A[i];
            m = A[i + 1];
            // Console.WriteLine("l + m : " + (l + m));
            if(l + m > A[i + 2])
            {
                return 1;
            }
        }
        
        return 0;
    }
}

User test case 1:

[2147483647, 2147483647, 2147483647]

Analysis

expand all Example tests

▶

example
example, positive answer, length=6

✔

0.056 s

▶

example1
example, answer is zero, length=4

✔

0.037 s

expand all User tests

▶

test_data1

✔

0.038 s

OK
function result: 1

Code: 05:18:00 UTC, cs, 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

using System;

class Solution {
    public int solution(int[] A) {
        
        Array.Sort(A);
        
        int N = A.Length;
        long l, m;
        
        for(int i = 0; i < (N - 2); i++)
        {
            l = A[i];
            m = A[i + 1];
            // Console.WriteLine("l + m : " + (l + m));
            if(l + m > A[i + 2])
            {
                return 1;
            }
        }
        
        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.059 s

▶

example1
example, answer is zero, length=4

✔

0.058 s

expand all Correctness tests

▶

extreme_empty
empty sequence

✔

0.059 s

0.058 s

0.059 s

0.062 s

0.061 s

▶

extreme_single
1-element sequence

✔

0.061 s

0.060 s

0.061 s

0.058 s

▶

extreme_two_elems
2-element sequence

✔

0.058 s

0.059 s

0.061 s

▶

extreme_negative1
three equal negative numbers

✔

0.061 s

0.059 s

▶

extreme_arith_overflow1
overflow test, 3 MAXINTs

✔

0.059 s

0.061 s

0.062 s

0.061 s

▶

extreme_arith_overflow2
overflow test, 10 and 2 MININTs

✔

0.062 s

0.059 s

▶

extreme_arith_overflow3
overflow test, 0 and 2 MAXINTs

✔

0.059 s

0.060 s

0.059 s

0.061 s

0.059 s

▶

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

✔

0.061 s

0.059 s

0.060 s

0.061 s

▶

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

✔

0.062 s

0.061 s

0.059 s

0.058 s

0.062 s

▶

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

✔

0.058 s

0.060 s

0.061 s

0.062 s

expand all Performance tests

▶

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

✔

0.067 s

0.061 s

0.063 s

0.061 s

▶

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

✔

0.080 s

0.062 s

0.058 s

0.059 s

0.060 s

▶

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

✔

0.112 s

0.062 s

0.059 s

0.060 s

0.062 s

▶

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

✔

0.116 s

0.059 s

0.062 s

0.061 s

▶

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

✔

0.097 s

0.061 s

0.060 s

▶

large_negative3
sequence of -1 value, length=100K

✔

0.093 s

0.060 s

0.059 s

0.058 s