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–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Time spent on task 4 minutes
Notes
not defined yet
Task timeline
Code: 23:47:48 UTC,
java,
verify,
result: Passed
// 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");
import java.util.Arrays;
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
Arrays.sort(A);
for(int i=0; i<A.length-2; i++) {
if(A[i] > 0 && A[i] > A[i+2] - A[i+1])
return 1;
}
return 0;
}
}
Analysis
Code: 23:47:57 UTC,
java,
final,
score:
100
// 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");
import java.util.Arrays;
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
Arrays.sort(A);
for(int i=0; i<A.length-2; i++) {
if(A[i] > 0 && A[i] > A[i+2] - A[i+1])
return 1;
}
return 0;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N))
expand all
Correctness tests
1.
0.192 s
OK
2.
0.058 s
OK
3.
0.035 s
OK
4.
0.072 s
OK
5.
0.051 s
OK
6.
0.087 s
OK
1.
0.057 s
OK
2.
0.118 s
OK
3.
0.051 s
OK
4.
0.063 s
OK
5.
0.059 s
OK
6.
0.034 s
OK
1.
0.054 s
OK
2.
0.044 s
OK
3.
0.195 s
OK
4.
0.035 s
OK
5.
0.036 s
OK
6.
0.074 s
OK
1.
0.048 s
OK
2.
0.055 s
OK
3.
0.033 s
OK
4.
0.152 s
OK
5.
0.049 s
OK
6.
0.076 s
OK
1.
0.044 s
OK
2.
0.063 s
OK
3.
0.117 s
OK
4.
0.032 s
OK
5.
0.253 s
OK
6.
0.071 s
OK
1.
0.034 s
OK
2.
0.054 s
OK
3.
0.034 s
OK
4.
0.058 s
OK
5.
0.097 s
OK
6.
0.190 s
OK
1.
0.097 s
OK
2.
0.295 s
OK
3.
0.056 s
OK
4.
0.035 s
OK
5.
0.061 s
OK
6.
0.045 s
OK
1.
0.177 s
OK
2.
0.087 s
OK
3.
0.085 s
OK
4.
0.098 s
OK
5.
0.035 s
OK
6.
0.073 s
OK
1.
0.196 s
OK
2.
0.061 s
OK
3.
0.083 s
OK
4.
0.034 s
OK
5.
0.086 s
OK
6.
0.046 s
OK
1.
0.070 s
OK
2.
0.034 s
OK
3.
0.078 s
OK
4.
0.034 s
OK
5.
0.052 s
OK
6.
0.040 s
OK
expand all
Performance tests
1.
0.265 s
OK
2.
0.061 s
OK
3.
0.095 s
OK
4.
0.035 s
OK
5.
0.073 s
OK
6.
0.050 s
OK
1.
0.308 s
OK
2.
0.057 s
OK
3.
0.048 s
OK
4.
0.077 s
OK
5.
0.034 s
OK
6.
0.050 s
OK
1.
0.743 s
OK
2.
0.034 s
OK
3.
0.147 s
OK
4.
0.128 s
OK
5.
0.034 s
OK
6.
0.043 s
OK
1.
0.450 s
OK
2.
0.108 s
OK
3.
0.095 s
OK
4.
0.062 s
OK
5.
0.083 s
OK
6.
0.050 s
OK
1.
0.390 s
OK
2.
0.082 s
OK
3.
0.066 s
OK
4.
0.121 s
OK
5.
0.107 s
OK
6.
0.032 s
OK
1.
0.488 s
OK
2.
0.076 s
OK
3.
0.156 s
OK
4.
0.034 s
OK
5.
0.036 s
OK
6.
0.078 s
OK