Tasks Details
easy
1.
MaxSliceSum
Find a maximum sum of a compact subsequence of array elements.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P ≤ Q < N, is called a slice of array A. The sum of a slice (P, Q) is the total of A[P] + A[P+1] + ... + A[Q].
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A consisting of N integers, returns the maximum sum of any slice of A.
For example, given array A such that:
A[0] = 3 A[1] = 2 A[2] = -6 A[3] = 4 A[4] = 0the function should return 5 because:
- (3, 4) is a slice of A that has sum 4,
- (2, 2) is a slice of A that has sum −6,
- (0, 1) is a slice of A that has sum 5,
- no other slice of A has sum greater than (0, 1).
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..1,000,000];
- each element of array A is an integer within the range [−1,000,000..1,000,000];
- the result will be 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 Java 21
Time spent on task 25 minutes
Notes
not defined yet
Code: 14:06:54 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.Arrays;
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
int[] Sum = new int[A.length];
Sum[0] = A[0];
for(int i=1; i<A.length; i++) {
Sum[i] = Sum[i-1] + A[i];
}
Arrays.sort(Sum);
return Sum[A.length-1] - Sum[0];
}
}
Analysis
expand all
Example tests
1.
0.034 s
WRONG ANSWER,
got 6 expected 5
Code: 14:18:45 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.Arrays;
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
int max_ending = A[0];
int max_slice = A[0];
for(int i=1; i<A.length; i++){
max_ending = Math.max(max_ending + A[i], A[i]);
max_slice = Math.max(max_slice, max_ending);
}
return max_slice;
}
}
Analysis
Code: 14:21:13 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.Arrays;
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
int max_ending = A[0];
int max_slice = A[0];
for(int i=1; i<A.length; i++){
max_ending = Math.max(max_ending + A[i], A[i]);
max_slice = Math.max(max_slice, max_ending);
}
return max_slice;
}
}
Analysis
Code: 14:21:19 UTC,
java,
final,
score:
100
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.Arrays;
class Solution {
public int solution(int[] A) {
// write your code in Java SE 8
int max_ending = A[0];
int max_slice = A[0];
for(int i=1; i<A.length; i++){
max_ending = Math.max(max_ending + A[i], A[i]);
max_slice = Math.max(max_slice, max_ending);
}
return max_slice;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.119 s
OK
2.
0.062 s
OK
3.
0.030 s
OK
1.
0.031 s
OK
2.
0.044 s
OK
3.
0.054 s
OK
4.
0.032 s
OK
5.
0.191 s
OK
6.
0.068 s
OK
7.
0.115 s
OK
8.
0.055 s
OK
9.
0.102 s
OK
1.
0.059 s
OK
2.
0.039 s
OK
3.
0.045 s
OK
4.
0.069 s
OK
5.
0.045 s
OK
6.
0.102 s
OK
7.
0.031 s
OK
8.
0.075 s
OK
9.
0.087 s
OK
10.
0.032 s
OK
11.
0.032 s
OK
12.
0.032 s
OK
13.
0.054 s
OK
14.
0.053 s
OK
15.
0.039 s
OK
16.
0.034 s
OK
17.
0.041 s
OK
18.
0.033 s
OK
19.
0.048 s
OK
20.
0.048 s
OK
21.
0.032 s
OK
22.
0.054 s
OK
23.
0.194 s
OK
24.
0.032 s
OK
25.
0.139 s
OK
26.
0.046 s
OK
27.
0.091 s
OK
1.
0.100 s
OK
1.
0.056 s
OK
1.
0.031 s
OK
1.
0.083 s
OK
1.
0.078 s
OK