Tasks Details
easy
Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).
Task Score
100%
Correctness
100%
Performance
100%
Task description
A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N).
For example, array A such that:
A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6contains the following example triplets:
- (0, 1, 2), product is −3 * 1 * 2 = −6
- (1, 2, 4), product is 1 * 2 * 5 = 10
- (2, 4, 5), product is 2 * 5 * 6 = 60
Your goal is to find the maximal product of any triplet.
Write a function:
function solution(A);
that, given a non-empty array A, returns the value of the maximal product of any triplet.
For example, given array A such that:
A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6the function should return 60, as the product of triplet (2, 4, 5) is maximal.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [3..100,000];
- each element of array A is an integer within the range [−1,000..1,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 12 minutes
Notes
not defined yet
Task timeline
Code: 14:48:57 UTC,
java,
autosave
Code: 14:50:45 UTC,
js,
autosave
Code: 14:57:49 UTC,
js,
autosave
Code: 14:59:45 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 6 expected 60
Code: 14:59:54 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got -12 expected 60
Code: 15:00:05 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 6 expected 60
stdout:
[ -3, -2, 1, 2, 5, 6 ]
Code: 15:00:11 UTC,
js,
autosave
Code: 15:00:14 UTC,
js,
verify,
result: Passed
Analysis
Code: 15:00:20 UTC,
js,
verify,
result: Passed
Analysis
Code: 15:00:22 UTC,
js,
verify,
result: Passed
Analysis
Code: 15:00:25 UTC,
js,
final,
score:
100
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
expand all
Performance tests
1.
0.084 s
OK
1.
0.112 s
OK
1.
0.188 s
OK
1.
0.128 s
OK
1.
0.120 s
OK
2.
0.120 s
OK