Tasks Details
easy
Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|.
Task Score
53%
Correctness
100%
Performance
0%
A non-empty array A consisting of N integers is given. Array A represents numbers on a tape.
Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1].
The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])|
In other words, it is the absolute difference between the sum of the first part and the sum of the second part.
For example, consider array A such that:
A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3We can split this tape in four places:
- P = 1, difference = |3 − 10| = 7
- P = 2, difference = |4 − 9| = 5
- P = 3, difference = |6 − 7| = 1
- P = 4, difference = |10 − 3| = 7
Write a function:
class Solution { public int solution(int[] A); }
that, given a non-empty array A of N integers, returns the minimal difference that can be achieved.
For example, given:
A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 4 A[4] = 3the function should return 1, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [2..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 Java 8
Time spent on task 1 minutes
Notes
not defined yet
Task timeline
Code: 14:36:28 UTC,
java,
verify,
result: Passed
import java.util.*;
class Solution {
public int solution(int[] A) {
int answer = -1;
int n = A.length;
for (int i=1; i<n; i++) {
int sumOfFirstArr = 0;
int sumOfSecondArr = 0;
for (int j=0; j<i; j++) {
sumOfFirstArr += A[j];
}
for (int j=i; j<n; j++) {
sumOfSecondArr += A[j];
}
int abs = Math.abs(sumOfFirstArr - sumOfSecondArr);
if (answer<0 || answer > abs) {
answer = abs;
}
}
return answer;
}
}
Analysis
Code: 14:36:34 UTC,
java,
verify,
result: Passed
import java.util.*;
class Solution {
public int solution(int[] A) {
int answer = -1;
int n = A.length;
for (int i=1; i<n; i++) {
int sumOfFirstArr = 0;
int sumOfSecondArr = 0;
for (int j=0; j<i; j++) {
sumOfFirstArr += A[j];
}
for (int j=i; j<n; j++) {
sumOfSecondArr += A[j];
}
int abs = Math.abs(sumOfFirstArr - sumOfSecondArr);
if (answer<0 || answer > abs) {
answer = abs;
}
}
return answer;
}
}
Analysis
Code: 14:36:39 UTC,
java,
final,
score:
53
import java.util.*;
class Solution {
public int solution(int[] A) {
int answer = -1;
int n = A.length;
for (int i=1; i<n; i++) {
int sumOfFirstArr = 0;
int sumOfSecondArr = 0;
for (int j=0; j<i; j++) {
sumOfFirstArr += A[j];
}
for (int j=i; j<n; j++) {
sumOfSecondArr += A[j];
}
int abs = Math.abs(sumOfFirstArr - sumOfSecondArr);
if (answer<0 || answer > abs) {
answer = abs;
}
}
return answer;
}
}Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N * N)
expand all
Correctness tests
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.004 s
OK
1.
0.004 s
OK
1.
0.020 s
OK
1.
0.008 s
OK
expand all
Performance tests
medium_random1
random medium, numbers from 0 to 100, length = ~10,000
random medium, numbers from 0 to 100, length = ~10,000
✘
TIMEOUT ERROR
running time: 1.304 sec., time limit: 0.100 sec.
running time: 1.304 sec., time limit: 0.100 sec.
1.
1.304 s
TIMEOUT ERROR,
running time: 1.304 sec., time limit: 0.100 sec.
medium_random2
random medium, numbers from -1,000 to 50, length = ~10,000
random medium, numbers from -1,000 to 50, length = ~10,000
✘
TIMEOUT ERROR
running time: 1.312 sec., time limit: 0.112 sec.
running time: 1.312 sec., time limit: 0.112 sec.
1.
1.312 s
TIMEOUT ERROR,
running time: 1.312 sec., time limit: 0.112 sec.
large_ones
large sequence, numbers from -1 to 1, length = ~100,000
large sequence, numbers from -1 to 1, length = ~100,000
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
large_random
random large, length = ~100,000
random large, length = ~100,000
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
large_sequence
large sequence, length = ~100,000
large sequence, length = ~100,000
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
large_extreme
large test with maximal and minimal values, length = ~100,000
large test with maximal and minimal values, length = ~100,000
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.