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:
class Solution { public int solution(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 2 minutes
Notes
not defined yet
Task timeline
Code: 12:23:11 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
//List <long> arr = new List<long>();
long s=A.Length;
long max =-1E9;
if(s==3)
{
return A[0]*A[1]*A[2];
}
else
{
if (max<A[0]*A[1]*A[s-1])
{
max=A[0]*A[1]*A[s-1];
}
if(max<A[s-3]*A[s-2]*A[s-1])
{
max=A[s-3]*A[s-2]*A[s-1];
}
}
return int.Parse(max.ToString());
}
}
}
Analysis
Compile error
Compilation failed: 1 error(s), 0 warnings Solution.cs(38,0): error CS1525: Unexpected symbol `}'
Code: 12:23:38 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
//List <long> arr = new List<long>();
long s=A.Length;
long max =-1E9;
if(s==3)
{
return A[0]*A[1]*A[2];
}
else
{
if (max<A[0]*A[1]*A[s-1])
{
max=A[0]*A[1]*A[s-1];
}
if(max<A[s-3]*A[s-2]*A[s-1])
{
max=A[s-3]*A[s-2]*A[s-1];
}
}
return int.Parse(max.ToString());
}
}
Analysis
Compile error
Compilation failed: 1 error(s), 0 warnings Solution.cs(14,20): error CS0266: Cannot implicitly convert type `double' to `long'. An explicit conversion exists (are you missing a cast?)
Code: 12:24:03 UTC,
cs,
verify,
result: Failed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
//List <long> arr = new List<long>();
long s=A.Length;
long double max = -1E9;
if(s==3)
{
return A[0]*A[1]*A[2];
}
else
{
if (max<A[0]*A[1]*A[s-1])
{
max=A[0]*A[1]*A[s-1];
}
if(max<A[s-3]*A[s-2]*A[s-1])
{
max=A[s-3]*A[s-2]*A[s-1];
}
}
return int.Parse(max.ToString());
}
}
Analysis
Compile error
Compilation failed: 1 error(s), 0 warnings Solution.cs(14,13): error CS1525: Unexpected symbol `double'
Code: 12:24:20 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
//List <long> arr = new List<long>();
long s=A.Length;
double max = -1E9;
if(s==3)
{
return A[0]*A[1]*A[2];
}
else
{
if (max<A[0]*A[1]*A[s-1])
{
max=A[0]*A[1]*A[s-1];
}
if(max<A[s-3]*A[s-2]*A[s-1])
{
max=A[s-3]*A[s-2]*A[s-1];
}
}
return int.Parse(max.ToString());
}
}
Analysis
Code: 12:24:26 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
//List <long> arr = new List<long>();
long s=A.Length;
double max = -1E9;
if(s==3)
{
return A[0]*A[1]*A[2];
}
else
{
if (max<A[0]*A[1]*A[s-1])
{
max=A[0]*A[1]*A[s-1];
}
if(max<A[s-3]*A[s-2]*A[s-1])
{
max=A[s-3]*A[s-2]*A[s-1];
}
}
return int.Parse(max.ToString());
}
}
Analysis
Code: 12:24:29 UTC,
cs,
final,
score:
100
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
Array.Sort(A);
//List <long> arr = new List<long>();
long s=A.Length;
double max = -1E9;
if(s==3)
{
return A[0]*A[1]*A[2];
}
else
{
if (max<A[0]*A[1]*A[s-1])
{
max=A[0]*A[1]*A[s-1];
}
if(max<A[s-3]*A[s-2]*A[s-1])
{
max=A[s-3]*A[s-2]*A[s-1];
}
}
return int.Parse(max.ToString());
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.066 s
OK
2.
0.066 s
OK
3.
0.064 s
OK
1.
0.066 s
OK
2.
0.065 s
OK
3.
0.065 s
OK
4.
0.066 s
OK
1.
0.066 s
OK
2.
0.065 s
OK
3.
0.064 s
OK
1.
0.064 s
OK
expand all
Performance tests
1.
0.066 s
OK
1.
0.069 s
OK
1.
0.111 s
OK
1.
0.082 s
OK
1.
0.097 s
OK
2.
0.107 s
OK