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 Java 21
Time spent on task 1 minutes
Notes
not defined yet
Code: 21:58:39 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can use System.out.println 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
if (A.length<3) return 0;
Arrays.sort(A);
for (int i=2; i<A.length; i++){
long sum = (long)A[i-1]+A[i-2];
if (sum>A[i]) return 1;
}
return 0;
}
}
Analysis
Compile error
Solution.java:11: error: cannot find symbol
Arrays.sort(A);
^
symbol: variable Arrays
location: class Solution
1 error
Code: 21:58:51 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
import java.util.*;
// you can use System.out.println 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
if (A.length<3) return 0;
Arrays.sort(A);
for (int i=2; i<A.length; i++){
long sum = (long)A[i-1]+A[i-2];
if (sum>A[i]) return 1;
}
return 0;
}
}
Analysis
Code: 21:58:59 UTC,
java,
final,
score:
100
// you can also use imports, for example:
import java.util.*;
// you can use System.out.println 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
if (A.length<3) return 0;
Arrays.sort(A);
for (int i=2; i<A.length; i++){
long sum = (long)A[i-1]+A[i-2];
if (sum>A[i]) return 1;
}
return 0;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N))
expand all
Correctness tests
1.
1.308 s
OK
2.
1.316 s
OK
3.
1.321 s
OK
4.
1.316 s
OK
5.
1.325 s
OK
1.
1.325 s
OK
2.
1.319 s
OK
3.
1.227 s
OK
4.
1.025 s
OK
5.
1.003 s
OK
1.
0.987 s
OK
2.
0.982 s
OK
3.
0.991 s
OK
4.
0.980 s
OK
5.
1.192 s
OK
1.
1.323 s
OK
2.
1.317 s
OK
3.
1.329 s
OK
4.
1.319 s
OK
5.
1.335 s
OK
1.
1.321 s
OK
2.
1.323 s
OK
3.
1.327 s
OK
4.
1.316 s
OK
5.
1.319 s
OK
1.
1.327 s
OK
2.
1.295 s
OK
3.
1.321 s
OK
4.
1.325 s
OK
5.
1.313 s
OK
1.
1.321 s
OK
2.
1.324 s
OK
3.
1.323 s
OK
4.
1.320 s
OK
5.
1.312 s
OK
1.
1.331 s
OK
2.
1.318 s
OK
3.
1.209 s
OK
4.
1.015 s
OK
5.
1.000 s
OK
1.
1.173 s
OK
2.
1.328 s
OK
3.
1.332 s
OK
4.
1.323 s
OK
5.
1.326 s
OK
1.
1.316 s
OK
2.
1.326 s
OK
3.
1.161 s
OK
4.
1.275 s
OK
5.
1.324 s
OK
expand all
Performance tests
1.
1.287 s
OK
2.
1.328 s
OK
3.
1.315 s
OK
4.
1.232 s
OK
5.
1.316 s
OK
1.
1.452 s
OK
2.
1.329 s
OK
3.
1.280 s
OK
4.
1.328 s
OK
5.
1.338 s
OK
1.
1.615 s
OK
2.
1.190 s
OK
3.
1.333 s
OK
4.
1.318 s
OK
5.
1.323 s
OK
1.
1.629 s
OK
2.
1.320 s
OK
3.
1.341 s
OK
4.
1.333 s
OK
5.
1.324 s
OK
1.
1.492 s
OK
2.
1.333 s
OK
3.
1.321 s
OK
4.
1.325 s
OK
5.
1.111 s
OK
1.
1.477 s
OK
2.
1.326 s
OK
3.
1.324 s
OK
4.
1.288 s
OK
5.
1.083 s
OK