Test results - Codility

Tasks Details

easy

1. TapeEquilibrium

Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|.

Task Score

16%

Correctness

33%

Performance

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 118 minutes

Notes

not defined yet

Code: 05:43:52 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43


// 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++11
    
    long int N = A.capacity();
    int i,j,p,min;
    
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    vector<int> B;
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}
    
    
    
    
    }
    

        
        
    
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:22:13: error: 'diff' was not declared in this scope
             diff = 2*A[p-1] - sum;
             ^
func.cpp:26:13: error: 'temp' was not declared in this scope
             temp = diff + 2* A[p-1];
             ^
func.cpp:26:20: error: 'diff' was not declared in this scope
             temp = diff + 2* A[p-1];
                    ^
func.cpp:27:13: error: 'absTemp' was not declared in this scope
             absTemp = abs(temp);
             ^
func.cpp:12:11: warning: unused variable 'j' [-Wunused-variable]
     int i,j,p,min;
           ^
func.cpp: At global scope:
func.cpp:37:5: error: expected declaration before '}' token
     }
     ^

Code: 05:44:22 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 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43


// 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++11
    
    long int N = A.capacity();
    int i, temp ,p, diff, min;
    
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    vector<int> B;
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}
    
    
    
    
    }
    

        
        
    
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:27:13: error: 'absTemp' was not declared in this scope
             absTemp = abs(temp);
             ^
func.cpp: At global scope:
func.cpp:37:5: error: expected declaration before '}' token
     }
     ^

Code: 05:50:01 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 26 27 28 29 30


// 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++11
    
    long int N = A.capacity();
    int i, p, min, absTemp;
    long int diff, 
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:14:5: error: expected unqualified-id before 'long'
     long int sum = 0;
     ^
func.cpp:15:29: error: 'sum' was not declared in this scope
     for (i = 0; i < N; i++)   sum += A[i];
                             ^
func.cpp:20:31: error: 'sum' was not declared in this scope
             diff = 2*A[p-1] - sum;
                               ^
func.cpp:24:13: error: 'temp' was not declared in this scope
             temp = diff + 2* A[p-1];
             ^

Code: 05:50:24 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 26 27 28 29 30


// 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++11
    
    long int N = A.capacity();
    int i, p, min, absTemp;
    long int diff;
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:24:13: error: 'temp' was not declared in this scope
             temp = diff + 2* A[p-1];
             ^

Code: 05:50:34 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 26 27 28 29 30


// 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++11
    
    long int N = A.capacity();
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

Code: 05:52:03 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 26 27 28 29 30


// 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++11
    
    long int N = A.capacity();
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 05:54:01 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 26 27 28 29 30 31


// 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++11
    
    long int N = A.capacity();
    cout << "N: " << N << endl;
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    for (i = 0; i < N; i++)   sum += A[i];
    
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

stdout:

N: 5

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

stdout:

N: 6

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 05:55: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 26 27 28 29 30 31 32 33


// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    cout << "sum: " << sum << endl;
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

stdout:

sum: 13

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

stdout:

sum: 23

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 05:58:37 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 26 27 28 29 30 31 32 33


// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 06:03:10 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2* A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 06:05: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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p < N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 06:10:56 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <= N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 1

User test case 1:

[8, -1, -1, 7, 6, 4]

Code: 06:12:52 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <= N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 1

▶

test_data2

✔

0.009 s

OK
function result: 3

User test case 1:

[8, -1, -1, 7, 6, 4]

User test case 2:

[1, 2, 3, 4, 5]

Code: 06:13:38 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <= N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 1

▶

test_data2

✔

0.009 s

OK
function result: 1

User test case 1:

[8, -1, -1, 7, 6, 4]

User test case 2:

[-1, 2, -3, 4, -5]

Code: 06:14:25 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <= N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 1

▶

test_data2

✔

0.009 s

OK
function result: 1

User test case 1:

[8, -1, -1, 7, 6, 4]

User test case 2:

[-1, -2, -3, 4, -5]

Code: 06:27:59 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

▶

test_data2

✔

0.009 s

OK
function result: 1

User test case 1:

[8, -1, -1, 7, 6, 4]

User test case 2:

[-1, -2, -3, 4, -5]

Code: 06:30:26 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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all User tests

▶

test_data1

✔

0.009 s

OK
function result: 5

▶

test_data2

✔

0.009 s

OK
function result: 1

User test case 1:

[8, -1, -1, 7, 6, 4]

User test case 2:

[-1, -2, -3, 4, -5]

Code: 06:30:31 UTC, cpp, final, score: 16

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 26 27 28 29 30 31 32 33

#include <stdlib.h>
// 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++11
    
    long int N = A.capacity();
    //cout << "N: " << N << endl;
    
    int i, p, min, absTemp;
    long int diff, temp;
    long int sum = 0;
    
    for (i = 0; i < N; i++)   sum += A[i];
    //cout << "sum: " << sum << endl;
    for (p = 1; p <N; p++) {
        
        if (p == 1){
            diff = 2*A[p-1] - sum;
            min = abs(diff);
        }
        else{
            temp = diff + 2*A[p-1];
            absTemp = abs(temp);
            if (absTemp < min)     min = absTemp;
        }
    }
    return min;
}

Analysis summary

The following issues have been detected: wrong answers.

For example, for the input [5, 6, 2, 4, 1] the solution returned a wrong answer (got 0 expected 4).

Analysis

expand all Example tests

▶

example
example test

✔

0.009 s

expand all Correctness tests

▶

double
two elements

✔

0.009 s

▶

simple_positive
simple test with positive numbers, length = 5

✘

WRONG ANSWER
got 0 expected 4

0.009 s

WRONG ANSWER, got 0 expected 4

▶

simple_negative
simple test with negative numbers, length = 5

✘

WRONG ANSWER
got 1 expected 3

0.009 s

WRONG ANSWER, got 1 expected 3

▶

small_random
random small, length = 100

✘

WRONG ANSWER
got 8985 expected 39

0.009 s

WRONG ANSWER, got 8985 expected 39

▶

small_range
range sequence, length = ~1,000

✘

WRONG ANSWER
got 498500 expected 56

0.009 s

WRONG ANSWER, got 498500 expected 56

▶

small
small elements

✔

0.009 s

expand all Performance tests

▶

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

✘

WRONG ANSWER
got 501606 expected 34

0.009 s

WRONG ANSWER, got 501606 expected 34

▶

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

✘

WRONG ANSWER
got 4727264 expected 196

0.010 s

WRONG ANSWER, got 4727264 expected 196

▶

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

✘

WRONG ANSWER
got 248 expected 0

0.015 s

WRONG ANSWER, got 248 expected 0

0.015 s

WRONG ANSWER, got 95 expected 1

▶

large_random
random large, length = ~100,000

✘

WRONG ANSWER
got 110489 expected 1

0.019 s

WRONG ANSWER, got 110489 expected 1

0.019 s

WRONG ANSWER, got 156456 expected 2

▶

large_sequence
large sequence, length = ~100,000

✘

WRONG ANSWER
got 2089577 expected 5

0.012 s

WRONG ANSWER, got 2089577 expected 5

▶

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

✘

WRONG ANSWER
got 99996000 expected 0

0.019 s

WRONG ANSWER, got 99996000 expected 0

0.021 s

0.018 s