Tasks Details
easy
Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).
Task Score
100%
Correctness
100%
Performance
100%
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:
int solution(vector<int> &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–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C++
Time spent on task 7 minutes
Notes
not defined yet
Task timeline
Code: 11:45:17 UTC,
java,
autosave
Code: 11:46:29 UTC,
cpp,
autosave
Code: 11:46:40 UTC,
cpp,
autosave
Code: 11:46:50 UTC,
cpp,
autosave
Code: 11:47:04 UTC,
cpp,
autosave
Code: 11:47:27 UTC,
cpp,
autosave
Code: 11:47:57 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
A.so
int max_val = A[len-1]*A[len-2]*A[len-3];
}
Code: 11:48:14 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int max_val = A[len-1]*A[len-2]*A[len-3];
}
Code: 11:48:24 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int max_val = A[len-1]*A[len-2]*A[len-3];
}
Code: 11:48:36 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right = A[len-1]*A[len-2]*A[len-3];
}
Code: 11:48:47 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int mul_right = A[len-1]*A[len-2]*A[len-3];
}
Code: 11:49:07 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
int left_tri
}
Code: 11:49:38 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0)
}
Code: 11:49:53 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1])
}
Code: 11:50:04 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
int
}
}
Code: 11:50:18 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet)
}
}
Code: 11:50:37 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet < A[0]*A[1]*A[len-1])
}
}
Code: 11:51:06 UTC,
cpp,
autosave
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet < A[0]*A[1]*A[len-1]){
right_triplet =
}
}
}
Code: 11:51:17 UTC,
cpp,
verify,
result: Failed
// you can use includes, for example:
// #include <algorithm>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet < A[0]*A[1]*A[len-1]){
right_triplet = A[0]*A[1]*A[len-1];
}
}
return right_triplet;
}
Analysis
Compile error
func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:10:28: error: 'sort' was not declared in this scope
sort(A.begin(), A.end());
^
Code: 11:51:31 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet < A[0]*A[1]*A[len-1]){
right_triplet = A[0]*A[1]*A[len-1];
}
}
return right_triplet;
}
Analysis
Code: 11:51:37 UTC,
cpp,
verify,
result: Passed
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet < A[0]*A[1]*A[len-1]){
right_triplet = A[0]*A[1]*A[len-1];
}
}
return right_triplet;
}
Analysis
Code: 11:51:42 UTC,
cpp,
final,
score:
100
// you can use includes, for example:
#include <bits/stdc++.h>
// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int len = A.size();
sort(A.begin(), A.end());
int right_triplet = A[len-1]*A[len-2]*A[len-3];
if(A[0]<0 && A[1]<0 && A[len-1]>0){
if(right_triplet < A[0]*A[1]*A[len-1]){
right_triplet = A[0]*A[1]*A[len-1];
}
}
return right_triplet;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
expand all
Performance tests
1.
0.001 s
OK
1.
0.001 s
OK
1.
0.012 s
OK
1.
0.004 s
OK
1.
0.004 s
OK
2.
0.008 s
OK