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:
function 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] = 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 JavaScript
Time spent on task 11 minutes
Notes
not defined yet
Code: 07:48:30 UTC,
java,
autosave
Code: 07:51:05 UTC,
js,
autosave
Code: 07:52:28 UTC,
js,
autosave
Code: 07:52:44 UTC,
js,
autosave
Code: 07:53:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2]
}
}
Code: 07:53:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
}
}
Code: 07:53:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular = true;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
}
}
Code: 07:53:59 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
if ()
}
}
Code: 07:54:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
if ()
}
}
Code: 07:54:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 +
if ()
}
}
Code: 07:55:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if ()
}
}
Code: 07:55:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0)
}
}
Code: 07:55:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
}
Code: 07:56:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
Code: 07:56:08 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
Analysis
Code: 07:56:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
Code: 07:56:43 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
User test case 1:
[1, 1, 1]
User test case 2:
[0, 1, 2]
User test case 3:
[5, 5, 6, 12, 123, 1, 2]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.068 s
OK
function result: 1
function result: 1
Code: 07:57:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
Code: 07:57:31 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
Code: 07:57:38 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
User test case 1:
[1, 1, 1]
User test case 2:
[0, 1, 2]
User test case 3:
[5, 5, 6, 12, 123, 1, 2]
User test case 4:
[-2147483648, -2147483648, -2147483648]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 0
function result: 0
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 0
function result: 0
Code: 07:58:00 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
User test case 1:
[1, 1, 1]
User test case 2:
[0, 1, 2]
User test case 3:
[5, 5, 6, 12, 123, 1, 2]
User test case 4:
[-2147483648, -2147483648, -2147483648]
User test case 5:
[2147483648,2147483648,2147483648]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.001 s
RUNTIME ERROR,
invalid input, integer value out of range: 2147483648
Code: 07:58:22 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
Code: 07:58:30 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
User test case 1:
[1, 1, 1]
User test case 2:
[0, 1, 2]
User test case 3:
[5, 5, 6, 12, 123, 1, 2]
User test case 4:
[-2147483648, -2147483648, -2147483648]
User test case 5:
[2147483647, 2147483647, 2147483647]
Analysis
Code: 07:59:02 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
return 1
}
}
return 0
}
User test case 1:
[1, 1, 1]
User test case 2:
[0, 1, 2]
User test case 3:
[5, 5, 6, 12, 123, 1, 2]
User test case 4:
[-2147483648, -2147483648, -2147483648]
User test case 5:
[2147483647, 2147483647, 2147483647]
Analysis
Code: 07:59:05 UTC,
js,
final,
score: 
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
if (A.length < 3) {
return 0;
}
A.sort((a,b) => a-b);
let triangular;
for (let i = 2; i < A.length; i++) {
let val0 = A[i];
let val1 = A[i-1];
let val2 = A[i-2];
let sum01 = val0 + val1;
let sum02 = val0 + val2;
let sum12 = val1 + val2;
if (sum01 > val2 && sum02 > val1 && sum12 > val0) {
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.068 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.072 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.072 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
expand all
Performance tests
1.
0.112 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.068 s
OK
1.
0.152 s
OK
2.
0.068 s
OK
3.
0.072 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
1.
0.204 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.208 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.068 s
OK
6.
0.072 s
OK
1.
0.156 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
1.
0.116 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.072 s
OK