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] = 20Triplet (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] = 20the function should return 1, as explained above. Given array A such that:
A[0] = 10 A[1] = 50 A[2] = 5 A[3] = 1the 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].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C#
Time spent on task 5 minutes
Notes
not defined yet
Task timeline
Code: 13:11:35 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if {A[i] == A[i+2] && A[i+2] == A[i=1] && A[i] = MaxInt)
{return 1;
break;
}
}
return 0;
}
}
}
}
Analysis
Compile error
Compilation failed: 7 error(s), 0 warnings
Solution.cs(11,8): error CS1525: Unexpected symbol `class'
Solution.cs(11,23): error CS1525: Unexpected symbol `{'
Solution.cs(12,4): error CS1525: Unexpected symbol `public'
Solution.cs(12,23): error CS1525: Unexpected symbol `('
Solution.cs(22,12): error CS1525: Unexpected symbol `{', expecting `('
Solution.cs(22,56): error CS1525: Unexpected symbol `='
Solution.cs(31,0): error CS1525: Unexpected symbol `}'
Code: 13:11:46 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if (A[i] == A[i+2] && A[i+2] == A[i=1] && A[i] = MaxInt)
{return 1;
break;
}
}
return 0;
}
}
}
}
Analysis
Compile error
Compilation failed: 6 error(s), 0 warnings
Solution.cs(11,8): error CS1525: Unexpected symbol `class'
Solution.cs(11,23): error CS1525: Unexpected symbol `{'
Solution.cs(12,4): error CS1525: Unexpected symbol `public'
Solution.cs(12,23): error CS1525: Unexpected symbol `('
Solution.cs(22,56): error CS1525: Unexpected symbol `='
Solution.cs(31,0): error CS1525: Unexpected symbol `}'
Code: 13:12:07 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if (A[i] == A[i+2] && A[i+2] == A[i+1] && A[i] = MaxInt)
{return 1;
break;
}
}
return 0;
}
}
}
}
Analysis
Compile error
Compilation failed: 6 error(s), 0 warnings
Solution.cs(11,8): error CS1525: Unexpected symbol `class'
Solution.cs(11,23): error CS1525: Unexpected symbol `{'
Solution.cs(12,4): error CS1525: Unexpected symbol `public'
Solution.cs(12,23): error CS1525: Unexpected symbol `('
Solution.cs(22,56): error CS1525: Unexpected symbol `='
Solution.cs(31,0): error CS1525: Unexpected symbol `}'
Code: 13:12:13 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if (A[i] == A[i+2] && A[i+2] == A[i+1] && A[i] == MaxInt)
{return 1;
break;
}
}
return 0;
}
}
}
}
Analysis
Compile error
Compilation failed: 5 error(s), 0 warnings
Solution.cs(11,8): error CS1525: Unexpected symbol `class'
Solution.cs(11,23): error CS1525: Unexpected symbol `{'
Solution.cs(12,4): error CS1525: Unexpected symbol `public'
Solution.cs(12,23): error CS1525: Unexpected symbol `('
Solution.cs(31,0): error CS1525: Unexpected symbol `}'
Code: 13:12:38 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if ((A[i] == A[i+2]) && (A[i+2] == A[i+1]) && (A[i] == MaxInt))
{return 1;
break;
}
}
return 0;
}
}
}
}
Analysis
Compile error
Compilation failed: 5 error(s), 0 warnings
Solution.cs(11,8): error CS1525: Unexpected symbol `class'
Solution.cs(11,23): error CS1525: Unexpected symbol `{'
Solution.cs(12,4): error CS1525: Unexpected symbol `public'
Solution.cs(12,23): error CS1525: Unexpected symbol `('
Solution.cs(31,0): error CS1525: Unexpected symbol `}'
Code: 13:13:05 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if ((A[i] == A[i+2]) && (A[i+2] == A[i+1]) && (A[i] == MaxInt))
{return 1;
break;
}
}
return 0;
}
}
Analysis
Compile error
Compilation failed: 1 error(s), 0 warnings Solution.cs(21,65): error CS0103: The name `MaxInt' does not exist in the current context
Code: 13:14:00 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if ((A[i] == A[i+2]) && (A[i+2] == A[i+1]) && (A[i] == Int32.MaxValue))
{return 1;
break;
}
}
return 0;
}
}
Analysis
Code: 13:14:06 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if ((A[i] == A[i+2]) && (A[i+2] == A[i+1]) && (A[i] == Int32.MaxValue))
{return 1;
break;
}
}
return 0;
}
}
Analysis
Code: 13:14:10 UTC,
cs,
final,
score:
100
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
if (A.Length <3) return 0;
for (int i=0 ; i<A.Length-2 ; i++)
{ if (A[i] + A[i+1] > A[i+2] )
{return 1;
break;
}
if ((A[i] == A[i+2]) && (A[i+2] == A[i+1]) && (A[i] == Int32.MaxValue))
{return 1;
break;
}
}
return 0;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N))
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.067 s
OK
4.
0.068 s
OK
5.
0.067 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.067 s
OK
4.
0.069 s
OK
5.
0.068 s
OK
1.
0.068 s
OK
2.
0.067 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
1.
0.069 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.067 s
OK
5.
0.068 s
OK
1.
0.067 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.067 s
OK
5.
0.068 s
OK
1.
0.067 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.067 s
OK
5.
0.067 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.067 s
OK
5.
0.066 s
OK
1.
0.066 s
OK
2.
0.067 s
OK
3.
0.068 s
OK
4.
0.066 s
OK
5.
0.067 s
OK
1.
0.067 s
OK
2.
0.067 s
OK
3.
0.067 s
OK
4.
0.068 s
OK
5.
0.067 s
OK
expand all
Performance tests
1.
0.073 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.067 s
OK
5.
0.067 s
OK
1.
0.088 s
OK
2.
0.067 s
OK
3.
0.067 s
OK
4.
0.067 s
OK
5.
0.068 s
OK
1.
0.121 s
OK
2.
0.066 s
OK
3.
0.066 s
OK
4.
0.066 s
OK
5.
0.066 s
OK
1.
0.146 s
OK
2.
0.069 s
OK
3.
0.067 s
OK
4.
0.067 s
OK
5.
0.066 s
OK
1.
0.106 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.069 s
OK
1.
0.104 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.067 s
OK