Codility - Triangle (JavaScript)
Lesson 6 - Sorting
Had to confirm I did this one right by looking at other solutions. XO
Task Description:
An array A consisting of N integers is given. A triplet (P, Q, R) is triangular if 0 lessthan or eq P lessthan Q lessthan R lessthan N and:
A[P] + A[Q] greaterthan A[R],
A[Q] + A[R] greaterthan A[P],
A[R] + A[P] greaterthan 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].
On this page of the site you can watch the video online Codility - Triangle (JavaScript) with a duration of hours minute second in good quality, which was uploaded by the user FRESH CODE SODA 28 May 2022, share the link with friends and acquaintances, this video has already been watched 632 times on youtube and it was liked by 9 viewers. Enjoy your viewing!
