Tasks Details
easy
Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|.
Task Score
100%
Correctness
100%
Performance
100%
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 C#
Time spent on task 7 minutes
Notes
not defined yet
Task timeline
Code: 09:58:59 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 1; P < A.Length; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
Analysis
Code: 09:59:37 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
Analysis
Code: 09:59:54 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length - 1; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
Analysis
Code: 10:00:11 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length - 1; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
User test case 3:
[3, 1, 2, 4, 3]
Analysis
expand all
User tests
1.
0.060 s
OK
function result: 0
function result: 0
1.
0.059 s
OK
function result: 2000
function result: 2000
1.
0.059 s
OK
function result: 1
function result: 1
Code: 10:00:36 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length - 1; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
User test case 3:
[3, 1, 2, 4, 3]
User test case 4:
[3, 2, 1]
Analysis
expand all
User tests
1.
0.059 s
OK
function result: 0
function result: 0
1.
0.059 s
OK
function result: 2000
function result: 2000
1.
0.060 s
OK
function result: 1
function result: 1
1.
0.059 s
OK
function result: 0
function result: 0
Code: 10:01:02 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length - 1; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
User test case 3:
[3, 1, 2, 4, 3]
User test case 4:
[3, 2, 1]
User test case 5:
[1000, -1000]
Analysis
Code: 10:03:28 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length - 1; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}
User test case 1:
[1, 2, 3]
User test case 2:
[-1000, 1000]
User test case 3:
[3, 1, 2, 4, 3]
User test case 4:
[3, 2, 1]
User test case 5:
[1000, -1000]
Analysis
Code: 10:03:33 UTC,
cs,
final,
score:
100
using System;
// you can also use other imports, for example:
// using System.Collections.Generic;
// you can write to stdout 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)
int[] arr_first, arr_second;
int min_difference = Int32.MaxValue;
int sum_first = 0;
int sum_second = 0;
for (int i = 0; i < A.Length; i++)
{
sum_second += A[i];
}
for (int P = 0; P < A.Length - 1; P++)
{
sum_first += A[P];
sum_second -= A[P];
int difference = Math.Abs(sum_first - sum_second);
if (difference < min_difference)
{
min_difference = difference;
}
}
return min_difference;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.064 s
OK
2.
0.064 s
OK
1.
0.067 s
OK
1.
0.066 s
OK
1.
0.061 s
OK
1.
0.061 s
OK
1.
0.061 s
OK
expand all
Performance tests
1.
0.065 s
OK
1.
0.065 s
OK
1.
0.102 s
OK
2.
0.101 s
OK
1.
0.102 s
OK
2.
0.090 s
OK
1.
0.082 s
OK
1.
0.097 s
OK
2.
0.095 s
OK
3.
0.086 s
OK