Test results - Codility

Tasks Details

medium

1. MinAbsSumOfTwo

Find the minimal absolute value of a sum of two elements.

Task Score

100%

Correctness

100%

Performance

100%

Let A be a non-empty array consisting of N integers.

The abs sum of two for a pair of indices (P, Q) is the absolute value |A[P] + A[Q]|, for 0 ≤ P ≤ Q < N.

For example, the following array A:

A[0] = 1 A[1] = 4 A[2] = -3

has pairs of indices (0, 0), (0, 1), (0, 2), (1, 1), (1, 2), (2, 2).
The abs sum of two for the pair (0, 0) is A[0] + A[0] = |1 + 1| = 2.
The abs sum of two for the pair (0, 1) is A[0] + A[1] = |1 + 4| = 5.
The abs sum of two for the pair (0, 2) is A[0] + A[2] = |1 + (−3)| = 2.
The abs sum of two for the pair (1, 1) is A[1] + A[1] = |4 + 4| = 8.
The abs sum of two for the pair (1, 2) is A[1] + A[2] = |4 + (−3)| = 1.
The abs sum of two for the pair (2, 2) is A[2] + A[2] = |(−3) + (−3)| = 6.

Write a function:

class Solution { public int solution(int[] A); }

that, given a non-empty array A consisting of N integers, returns the minimal abs sum of two for any pair of indices in this array.

For example, given the following array A:

A[0] = 1 A[1] = 4 A[2] = -3

the function should return 1, as explained above.

Given array A:

A[0] = -8 A[1] = 4 A[2] = 5 A[3] =-10 A[4] = 3

the function should return |(−8) + 5| = 3.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..100,000];

each element of array A is an integer within the range [−1,000,000,000..1,000,000,000].

Solution

Programming language used Java 8

Time spent on task 20 minutes

Notes

not defined yet

Task timeline

Code: 02:45:42 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: 02:47:09 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) {
       
    }
}

Code: 02:47:19 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) {
       int min = 
    }
}

Code: 02:47:41 UTC, java, autosave

show code in pop-up

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

// 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) {
       int min = Integer.MAX_VALUE;
       int left = 0;
       int right = A.length - 1;

    }
}

Code: 02:47:56 UTC, java, autosave

show code in pop-up

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

// 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) {
       int min = Integer.MAX_VALUE;
       int left = 0;
       int right = A.length - 1;

       Arrays.sort(A);

    }
}

Code: 02:48:07 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

// 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) {
       int min = Integer.MAX_VALUE;
       int left = 0;
       int right = A.length - 1;

       Arrays.sort(A);

       while ()

    }
}

Code: 02:48:36 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

// 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) {
       int min = Integer.MAX_VALUE;
       int left = 0;
       int right = A.length - 1;

       Arrays.sort(A);

       while () {
           if (Math.abs())
       }

    }
}

Code: 02:48:48 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

// 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) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while () {
           if (Math.abs(A[p] + A[q]))
       }

    }
}

Code: 02:49: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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while () {
           if (Math.abs(A[p] + A[q]))
       }

    }
}

Code: 02:49:26 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while () {
           if (min > Math.abs(A[p] + A[q])) min = 
       }

    }
}

Code: 02:49:37 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while () {
           if (min > Math.abs(A[p] + A[q])) min = Math.abs(A[p] + A[q]);
       }

    }
}

Code: 02:50:00 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while () {
           int current = Math.abs(A[p] + A[q]);
           if (min > current) min = current;
           
       }

    }
}

Code: 02:50:32 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;


       while () {
           int current = Math.abs(A[p] + A[q]);
           if (min > current) min = current;

       }

    }
}

Code: 02:51:10 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <) {
           int current = Math.abs(A[p] + A[q]);
           if (min > current) min = current;

       }

    }
}

Code: 02:51:40 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <= q) { // the other way of for loop
           int current = Math.abs(A[p] + A[q]);
           if (min > current) min = current;
           p++;
       }
    
    retu
    }
}

Code: 02:51:45 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <= q) { // the other way of for loop
           int current = Math.abs(A[p] + A[q]);
           if (min > current) min = current;
           p++;
       }
    
        return min;
    }
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.008 s

▶

example2
second example

✘

WRONG ANSWER
got 5 expected 3

0.012 s

WRONG ANSWER, got 5 expected 3

Code: 02:52: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 21 22 23 24

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <= q) { // the other way of for loop
           int current = Math.abs(A[p] + A[q]);
           m min = current;
           p++;
       }
    
        return min;
    }
}

Code: 02:53:08 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <= q) { // the other way of for loop
           int current = Math.abs(A[p] + A[q]);
           min = Math.min(min, current);
           p++;
       }
    
        return min;
    }
}

Code: 02:53:19 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <= q) { // the other way of for loop
           min = Math.min(min, Math.abs(A[p] + A[q]));
           p++;
       }
    
        return min;
    }
}

Code: 02:53:21 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       while (p <= q) { // the other way of for loop
           min = Math.min(min, Math.abs(A[p] + A[q]));
           p++;
       }
    
        return min;
    }
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.004 s

▶

example2
second example

✘

WRONG ANSWER
got 5 expected 3

0.008 s

WRONG ANSWER, got 5 expected 3

Code: 02:53:50 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
           min = Math.min(min, Math.abs(A[p] + A[q]));
           p++;
       }
    
        return min;
    }
}

Code: 02:54: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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -3 1 4

       while (p <= q) { // the other way of for loop
           min = Math.min(min, Math.abs(A[p] + A[q]));
           p++;
       }
    
        return min;
    }
}

Code: 02:54: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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -3 1 4

       while (p <= q) { // the other way of for loop
        int current = Math.abs(A[p] + A[q]);
           min = Math.min(min, current);
           p++;
       }
    
        return min;
    }
}

Code: 02:54: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 19 20 21 22 23 24 25 26

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -3 1 4

       while (p <= q) { // the other way of for loop
       int current = Math.abs(A[p] + A[q]);
       min = Math.min(min, current);
           p++;
       }
    
        return min;
    }
}

Code: 02:54:54 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -3 1 4

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            p++;
       }
    
        return min;
    }
}

Code: 02:55:24 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -3 1 4

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // 
            if ()
       }
    
        return min;
    }
}

Code: 02:55:46 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -3 1 4

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++;
       }
    
        return min;
    }
}

Code: 02:56: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 22 23 24 25 26 27 28

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++;
       }
    
        return min;
    }
}

Code: 02:56:16 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++;
            else q--;
       }
    
        return min;
    }
}

Code: 02:56:26 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

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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++;
            else q--;
       }
    
        return min;
    }
}

Code: 02:56: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 23

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++;
            else q--;
       }
    
        return min;
    }
}

Code: 02:57: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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Code: 03:02:01 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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current <= 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.008 s

▶

example2
second example

✘

WRONG ANSWER
got 5 expected 3

0.004 s

WRONG ANSWER, got 5 expected 3

Code: 03:03:08 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.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Code: 03:03:28 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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A); // -10 -8 3 4 5

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.008 s

▶

example2
second example

✘

WRONG ANSWER
got 5 expected 3

0.008 s

WRONG ANSWER, got 5 expected 3

Code: 03:03:40 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.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Code: 03:04: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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
        
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Code: 03:04: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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
            int current = A[p] + A[q];
            int current = Math.abs(A[p] + A[q]);
            min = Math.min(min, current);
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Code: 03:05:00 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.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
            int current = A[p] + A[q];
            min = Math.min(min, Math.abs(current));
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Code: 03:05:02 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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
            int current = A[p] + A[q];
            min = Math.min(min, Math.abs(current));
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.008 s

▶

example2
second example

✔

0.004 s

Code: 03:05:33 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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
            int current = A[p] + A[q];
            min = Math.min(min, Math.abs(current));
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.008 s

▶

example2
second example

✔

0.004 s

Code: 03:05:38 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

import java.util.Arrays;
import java.lang.Math;

class Solution {
    public int solution(int[] A) {
       int min = Integer.MAX_VALUE;
       int p = 0;
       int q = A.length - 1;

       Arrays.sort(A);

       while (p <= q) { // the other way of for loop
            int current = A[p] + A[q];
            min = Math.min(min, Math.abs(current));
            
            // caterpillar method
            if (current < 0) p++; // -
            else q--; // +
       }
    
        return min;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N * log(N))

expand all Example tests

▶

example1
first example

✔

0.004 s

▶

example2
second example

✔

0.008 s

expand all Correctness tests

▶

extreme_single
sequences of 1 elements

✔

0.004 s

0.008 s

0.004 s

▶

extreme_double
sequences of 2 elements

✔

0.004 s

0.008 s

▶

positive_small
only positive numbers

✔

0.008 s

▶

negative_small
only negative numbers

✔

0.004 s

expand all Performance tests

▶

random_small
random sequence, length = ~1000

✔

0.012 s

▶

random_medium
random sequence, length = ~10,000

✔

0.048 s

▶

arithmetic_medium
arithemtic sequence, length = ~10,000

✔

0.104 s

▶

random_large
random sequence, length = ~100,000

✔

0.396 s

▶

extreme_large
sequence of MAX_INT, length = ~100,000

✔

0.376 s

▶

arithmetic_large
arithmetic sequence, length = ~100,000

✔

0.376 s

▶

constant_distance
constant distance between all elements, length = 100,000

✔

0.328 s