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:

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] = 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 Java 8

Time spent on task 14 minutes

Notes

not defined yet

Task timeline

Code: 14:42:30 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: 14:43:00 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        s

        return answer;
    }
}

Code: 14:43:15 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        for ()

        return answer;
    }
}

Code: 14:43:34 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        for (int i=1; )

        return answer;
    }
}

Code: 14:43:56 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        for (int i=1; i<n; i++) {
            
        }

        return answer;
    }
}

Code: 14:44:25 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int 
        for (int i=1; i<n; i++) {

        }

        return answer;
    }
}

Code: 14:44:37 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = 
        for (int i=1; i<n; i++) {

        }

        return answer;
    }
}

Code: 14:45:01 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 
        for (int i=1; i<n; i++) {

        }

        return answer;
    }
}

Code: 14:45:12 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for

        for (int i=1; i<n; i++) {

        }

        return answer;
    }
}

Code: 14:45:43 UTC, java, autosave

show code in pop-up

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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for ()

        for (int i=1; i<n; i++) {

        }

        return answer;
    }
}

Code: 14:46:02 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum
        }

        for (int i=1; i<n; i++) {

        }

        return answer;
    }
}

Code: 14:46:15 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }

        for (int i=1; i<n; i++) {
            
        }

        return answer;
    }
}

Code: 14:46:55 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }

        for (int i=1; i<n; i++) {
            lef
        }

        return answer;
    }
}

Code: 14:47:05 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }

        for (int i=1; i<n; i++) {
            leftSum
        }

        return answer;
    }
}

Code: 14:47:22 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(le)

        for (int i=1; i<n; i++) {
            leftSum
        }

        return answer;
    }
}

Code: 14:47:34 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum
        }

        return answer;
    }
}

Code: 14:48:04 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[]
        }

        return answer;
    }
}

Code: 14:48:14 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1]
        }

        return answer;
    }
}

Code: 14:48:25 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
        }

        return answer;
    }
}

Code: 14:48:52 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
        }

        return answer;
    }
}

Code: 14:49:03 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            
        }

        return answer;
    }
}

Code: 14:49:34 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Ma
        }

        return answer;
    }
}

Code: 14:49:51 UTC, java, 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 26

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            
            int tmp = Math.abs(leftSum-rightSum);
            
            if ()
        }

        return answer;
    }
}

Code: 14:50:15 UTC, java, 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 26 27

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return answer;
    }
}

Code: 14:50:23 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=1; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }
        answer = abs;

        return answer;
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.004 s

WRONG ANSWER, got 0 expected 1

Code: 14:51:33 UTC, java, 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 26 27 28

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }
        answer = abs;

        return answer;
    }
}

Code: 14:51:34 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }
        answer = abs;

        return answer;
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.008 s

WRONG ANSWER, got 2 expected 1

Code: 14:52:03 UTC, java, 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 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if ()

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }
        answer = abs;

        return answer;
    }
}

Code: 14:52:15 UTC, java, 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 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n==2)

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }
        answer = abs;

        return answer;
    }
}

Code: 14:52:30 UTC, java, 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 26 27 28 29 30 31 32

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }
        answer = abs;

        return answer;
    }
}

Code: 14:52:41 UTC, java, 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 26 27 28 29 30 31

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer = 0;
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return abs;
    }
}

Code: 14:52:43 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return abs;
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.004 s

WRONG ANSWER, got 2 expected 1

Code: 14:53:12 UTC, java, 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 26 27 28 29 30 31

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.
        }

        return abs;
    }
}

Code: 14:53:19 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.println(abs);
        }

        return abs;
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.004 s

WRONG ANSWER, got 2 expected 1

stdout:

4
2
2

Code: 14:54:12 UTC, java, 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 26 27 28 29 30 31 32

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.println(abs);
        }

        return abs;
    }
}

Code: 14:54:22 UTC, java, 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 26 27 28 29 30 31 32

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            System.out.println()
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.println(abs);
        }

        return abs;
    }
}

Code: 14:54:46 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i];
            System.out.println("leftSum=" + leftSum + " rightSum=" + rightSum);
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.println(abs);
        }

        return abs;
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.004 s

WRONG ANSWER, got 2 expected 1

stdout:

leftSum=4 rightSum=8
4
leftSum=6 rightSum=4
2
leftSum=10 rightSum=1
2

Code: 14:55:30 UTC, java, 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 26 27 28 29 30 31 32

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i-1];
            System.out.println("leftSum=" + leftSum + " rightSum=" + rightSum);
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.println(abs);
        }

        return abs;
    }
}

Code: 14:55:32 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i-1];
            System.out.println("leftSum=" + leftSum + " rightSum=" + rightSum);
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
            System.out.println(abs);
        }

        return abs;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.012 s

stdout:

leftSum=4 rightSum=9
5
leftSum=6 rightSum=7
1
leftSum=10 rightSum=3
1

Code: 14:56:01 UTC, java, 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 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i-1];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return abs;
    }
}

Code: 14:56:04 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i-1];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return abs;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.008 s

Code: 14:56:10 UTC, java, 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

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i-1];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return abs;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.004 s

Code: 14:56:15 UTC, java, 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 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int n = A.length;

        int leftSum = A[0];
        int rightSum = 0;
        for (int i=1; i<n; i++) {
            rightSum += A[i];
        }
        int abs = Math.abs(leftSum-rightSum);

        if (n<=2) {
            return abs;
        }

        for (int i=2; i<n; i++) {
            leftSum += A[i-1];
            rightSum -= A[i-1];
            int tmp = Math.abs(leftSum-rightSum);
            
            if (abs > tmp) {
                abs = tmp;
            }
        }

        return abs;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.008 s

expand all Correctness tests

▶

double
two elements

✔

0.008 s

0.004 s

▶

simple_positive
simple test with positive numbers, length = 5

✔

0.008 s

0.004 s

▶

simple_negative
simple test with negative numbers, length = 5

✔

0.008 s

0.012 s

▶

simple_boundary
only one element on one of the sides

✔

0.012 s

0.008 s

0.012 s

0.008 s

▶

small_random
random small, length = 100

✔

0.008 s

▶

small_range
range sequence, length = ~1,000

✔

0.008 s

▶

small
small elements

✔

0.008 s

expand all Performance tests

▶

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

✔

0.024 s

▶

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

✔

0.028 s

▶

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

✔

0.168 s

0.160 s

▶

large_random
random large, length = ~100,000

✔

0.208 s

▶

large_sequence
large sequence, length = ~100,000

✔

0.096 s

▶

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

✔

0.228 s

0.236 s

0.188 s