Test results - Codility

Tasks Details

easy

1. TapeEquilibrium

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] = 3

We 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:

int solution(vector<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] = 3

the 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].

Solution

Programming language used C++

Time spent on task 13 minutes

Notes

not defined yet

Task timeline

Code: 05:58:43 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// 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");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 05:59:05 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

// 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();

    for()
}

Code: 05:59:35 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

// 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();
    vector<int> v;

    for(int i=0; i<len; i++){

    }
}

Code: 05:59:56 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

// 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();
    vector<int> sum;

    for(int i=0; i<len; i++){
        sum[i] +=sum[i+];
    }
}

Code: 06:00:26 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i+];
    }
}

Code: 06:00:37 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
}

Code: 06:02:47 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
        
    }
}

Code: 06:02:58 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
}

Code: 06:03:16 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1;)
}

Code: 06:03:47 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        
    }
}

Code: 06:04:06 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        sum[i] - sum[]
    }
}

Code: 06:04:23 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        sum[i] - sum[len-1]
    }
}

Code: 06:04:40 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        sum[i] - sum[len-1]- sum[i-1]
    }
}

Code: 06:04:51 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:05:11 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// 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();
    int min = 
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minA = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:05:37 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    int min = 
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minA = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:05:48 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++.h>
#define MAX 
// 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();
    int min = 
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minA = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:05:58 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++.h>
#define MAX 123
// 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();
    int min = 
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minA = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:06:55 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++.h>
#define MAX 
// 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();
    int min = 
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minA = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:07:09 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

// 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();
    int min = INT_MAX;
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minA = sum[i] - (sum[len-1]- sum[i-1])
    }
}

Code: 06:07:33 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21

// 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();
    int min = INT_MAX;
    vector<int> sum;

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:07:44 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// 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();
    int min = INT_MAX;
    vector<int> sum;


    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:07:54 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// 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();
    int min = INT_MAX;
    vector<int> sum;

    if()
    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:08:13 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// 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();
    int min = INT_MAX;
    vector<int> sum;

    if(A)
    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:08:36 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

// 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();
    int min = INT_MAX;
    vector<int> sum;

    if(len == 2){
        return A[1] - A[0];
    }
    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:08:53 UTC, cpp, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int min = INT_MAX;
    vector<int> sum;

    if(len == 2){
        return A[1] - A[0];
    }
    
    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:21:9: error: 'minVal' was not declared in this scope
         minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
         ^~~~~~
func.cpp:21:61: error: 'min' cannot be used as a function
         minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
                                                             ^
func.cpp:24:12: error: 'minVal' was not declared in this scope
     return minVal;
            ^~~~~~

Code: 06:09:04 UTC, cpp, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum;

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.001 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Segmentation Fault

Code: 06:09:16 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum();

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:09:23 UTC, cpp, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] +=sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 3 expected 1

0.001 s

WRONG ANSWER, got 3 expected 1

Code: 06:09:56 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] sum[i-1];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:10:10 UTC, cpp, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(sum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got -6 expected 1

0.001 s

WRONG ANSWER, got -6 expected 1

Code: 06:10:49 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(abssum[i] - (sum[len-1]- sum[i-1]), minVal);
    }

    return minVal;
}

Code: 06:10:59 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(abs(sum[i] - (sum[len-1]- sum[i-1])), minVal);
    }

    return minVal;
}

Code: 06:11:09 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(abs(sum[i-1] - (sum[len-1]- sum[i-1])), minVal);
    }

    return minVal;
}

Code: 06:11:21 UTC, cpp, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(abs(sum[i-1] - (sum[len-1]- sum[i-1])), minVal);
    }

    return minVal;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.001 s

Code: 06:11:28 UTC, cpp, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(abs(sum[i-1] - (sum[len-1]- sum[i-1])), minVal);
    }

    return minVal;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.001 s

Code: 06:11:33 UTC, cpp, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

// 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();
    int minVal = INT_MAX;
    vector<int> sum(len, 0);

    if(len == 2){
        return A[1] - A[0];
    }

    sum[0] = A[0];
    for(int i=1; i<len; i++){
        sum[i] = sum[i-1] + A[i];
    }
    for(int i=1; i<len; i++){
        minVal = min(abs(sum[i-1] - (sum[len-1]- sum[i-1])), minVal);
    }

    return minVal;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.001 s

expand all Correctness tests

▶

double
two elements

✔

0.001 s

▶

simple_positive
simple test with positive numbers, length = 5

✔

0.001 s

▶

simple_negative
simple test with negative numbers, length = 5

✔

0.001 s

▶

simple_boundary
only one element on one of the sides

✔

0.001 s

▶

small_random
random small, length = 100

✔

0.001 s

▶

small_range
range sequence, length = ~1,000

✔

0.001 s

▶

small
small elements

✔

0.001 s

expand all Performance tests

▶

medium_random1
random medium, numbers from 0 to 100, length = ~10,000

✔

0.001 s

▶

medium_random2
random medium, numbers from -1,000 to 50, length = ~10,000

✔

0.001 s

▶

large_ones
large sequence, numbers from -1 to 1, length = ~100,000

✔

0.004 s

▶

large_random
random large, length = ~100,000

✔

0.008 s

0.004 s

▶

large_sequence
large sequence, length = ~100,000

✔

0.004 s

▶

large_extreme
large test with maximal and minimal values, length = ~100,000

✔

0.004 s

0.008 s

0.004 s