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:

function solution(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 JavaScript

Time spent on task 5 minutes

Notes

not defined yet

Code: 13:45:03 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: 13:45:07 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
}

Code: 13:45:18 UTC, js, 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 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else {
            break;
        }
    }
    return minSum;
}

Code: 13:45:39 UTC, js, 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 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else {
            break;
        }
    }
    return minSum;
}

Code: 13:45:51 UTC, js, 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 33 34 35 36 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else {
            break;
        }
    }
    return minSum;
}

Code: 13:46:21 UTC, js, 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 33 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left++;
        } else {
            break;
        }
    }
    return minSum;
}

Code: 13:46:27 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left++;
        } else {
            right++;
        }
    }
    return minSum;
}

Analysis

expand all Example tests

▶

example1
first example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

▶

example2
second example

✘

TIMEOUT ERROR
Killed. Hard limit reached: 5.000 sec.

5.000 s

TIMEOUT ERROR, Killed. Hard limit reached: 5.000 sec.

Code: 13:46:49 UTC, js, 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 33 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left++;
        } else {
            right++;
        }
    }
    return minSum;
}

Code: 13:46:57 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left++;
        } else {
            right++;
        }
    }
    return minSum;
}

Analysis

expand all Example tests

▶

example1
first example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

▶

example2
second example

✘

TIMEOUT ERROR
Killed. Hard limit reached: 5.000 sec.

5.000 s

TIMEOUT ERROR, Killed. Hard limit reached: 5.000 sec.

Code: 13:47:19 UTC, js, 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 33 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left-;
        } else {
            right++;
        }
    }
    return minSum;
}

Code: 13:47:21 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left*2]), Math.abs(A[right*2]));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

Analysis

expand all Example tests

▶

example1
first example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

▶

example2
second example

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

Code: 13:47:49 UTC, js, 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 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left] * 2), Math.abs(A[right] * 2));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

Analysis

expand all Example tests

▶

example1
first example

✔

0.072 s

▶

example2
second example

✔

0.072 s

Code: 13:48:14 UTC, js, 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 33 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left] * 2), Math.abs(A[right] * 2));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

Code: 13:48:15 UTC, js, 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 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left] * 2), Math.abs(A[right] * 2));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

User test case 1:

[-1000000000, -999999999]

Analysis

expand all Example tests

▶

example1
first example

✔

0.068 s

▶

example2
second example

✔

0.068 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 1999999998

Code: 13:49:25 UTC, js, 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 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left] * 2), Math.abs(A[right] * 2));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

User test case 1:

[-1000000000, -999999999]

Analysis

expand all Example tests

▶

example1
first example

✔

0.072 s

▶

example2
second example

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: 1999999998

Code: 13:49:58 UTC, js, 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 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left] * 2), Math.abs(A[right] * 2));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

User test case 1:

[-1000000000, -999999999]

Analysis

expand all Example tests

▶

example1
first example

✔

0.072 s

▶

example2
second example

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: 1999999998

Code: 13:50:01 UTC, js, 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 31 32 33 34 35 36 37 38 39 40 41

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A) {
    // write your code in JavaScript (Node.js 8.9.4)
    if (A.length === 1) {
        return Math.abs(A[0]*2);
    }
    
    A.sort((a, b) => a - b);
    let left = 0;
    let right = 0;
    for (let i = 0; i < A.length; i++) {
        if (A[i] === 0) {
            return 0;
        } else if (A[i] > 0) {
            left = i;
            right = i;
            break;
        }
    }
    
    let minSum = 2000000000;
    while (left >= 0 && right < A.length) {
        let sum = A[left] + A[right]
        minSum = Math.min(minSum, Math.abs(sum), Math.abs(A[left] * 2), Math.abs(A[right] * 2));
        
        if (sum === 0) {
            return 0;
        } else if (sum > 0 && left > 0) {
            left--;
        } else if (sum < 0 && right < A.length - 1) {
            right++;
        } else if (left > 0) {
            left--;
        } else {
            right++;
        }
    }
    return minSum;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N * log(N))

expand all Example tests

▶

example1
first example

✔

0.072 s

▶

example2
second example

✔

0.068 s

expand all Correctness tests

▶

extreme_single
sequences of 1 elements

✔

0.068 s

▶

extreme_double
sequences of 2 elements

✔

0.068 s

0.072 s

0.068 s

▶

positive_small
only positive numbers

✔

0.068 s

▶

negative_small
only negative numbers

✔

0.072 s

expand all Performance tests

▶

random_small
random sequence, length = ~1000

✔

0.080 s

▶

random_medium
random sequence, length = ~10,000

✔

0.112 s

▶

arithmetic_medium
arithemtic sequence, length = ~10,000

✔

0.136 s

▶

random_large
random sequence, length = ~100,000

✔

0.212 s

▶

extreme_large
sequence of MAX_INT, length = ~100,000

✔

0.128 s

▶

arithmetic_large
arithmetic sequence, length = ~100,000

✔

0.212 s

▶

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

✔

0.216 s