Test results - Codility

Tasks Details

medium

1. NumberOfDiscIntersections

Compute the number of intersections in a sequence of discs.

Task Score

100%

Correctness

100%

Performance

100%

We draw N discs on a plane. The discs are numbered from 0 to N − 1. An array A of N non-negative integers, specifying the radiuses of the discs, is given. The J-th disc is drawn with its center at (J, 0) and radius A[J].

We say that the J-th disc and K-th disc intersect if J ≠ K and the J-th and K-th discs have at least one common point (assuming that the discs contain their borders).

The figure below shows discs drawn for N = 6 and A as follows:

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

There are eleven (unordered) pairs of discs that intersect, namely:

discs 1 and 4 intersect, and both intersect with all the other discs;

disc 2 also intersects with discs 0 and 3.

Write a function:

function solution(A);

that, given an array A describing N discs as explained above, returns the number of (unordered) pairs of intersecting discs. The function should return −1 if the number of intersecting pairs exceeds 10,000,000.

Given array A shown above, the function should return 11, as explained above.

Write an efficient algorithm for the following assumptions:

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

each element of array A is an integer within the range [0..2,147,483,647].

Solution

Programming language used JavaScript

Time spent on task 13 minutes

Notes

not defined yet

Code: 15:48:11 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: 15:48:15 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: 15:48:39 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8

// 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)
    let circles = [];
    let count = -
}

Code: 15:48:52 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 
}

Code: 15:49:10 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
}

Code: 15:49:40 UTC, js, autosave

show code in pop-up

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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push
    }
}

Code: 15:49:50 UTC, js, autosave

show code in pop-up

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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            base
        })
    }
}

Code: 15:50:20 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
}

Code: 15:50: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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    items.sort((a,b) => a.start - b.start)
}

Code: 15:51: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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    items.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < item)
}

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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        
    }
}

Code: 15:52:11 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles.
    }
}

Code: 15:52:40 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while ()
    }
}

Code: 15:52:54 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] )
    }
}

Code: 15:53:07 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >)
    }
}

Code: 15:53:24 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end > circles[j].start)
    }
}

Code: 15:53:35 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if ()
        }
    }
}

Code: 15:53:46 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (count)
        }
    }
}

Code: 15:54:07 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
        }
    }
}

Code: 15:55:10 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            
        }
    }
}

Code: 15:55:32 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

// 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)
    let circles = [];
    let count = -;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Code: 15:55:38 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i];
            end: i + A[i];
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Analysis

expand all Example tests

▶

example1
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

solution.js:13
            start: i - A[i];
                           ^

SyntaxError: Unexpected token ;
    at createScript (vm.js:80:10)
    at Object.runInNewContext (vm.js:135:10)
    at getSolution (/tmp/exec.js:392:29)
    at Promise.resolve.then (/tmp/exec.js:426:34)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

Code: 15:55:53 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    let samStart = 0;
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Analysis

expand all Example tests

▶

example1
example test

✔

0.068 s

Code: 15:56:43 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);
    
    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Code: 15:56:53 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Code: 15:57:46 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Code: 15:57:53 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

User test case 1:

[0, 1, 2]

Analysis

expand all Example tests

▶

example1
example test

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 3

Code: 15:58:07 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

User test case 1:

[0, 1, 2]

User test case 2:

[5]

Analysis

expand all Example tests

▶

example1
example test

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: 3

▶

test_data2

✔

0.072 s

OK
function result: 0

Code: 15:58:16 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Code: 16:00:00 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Code: 16:00:06 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

User test case 1:

[0, 1, 2]

User test case 2:

[5]

User test case 3:

[10, 1, 1, 1, 1, 1]

Analysis

expand all Example tests

▶

example1
example test

✔

0.068 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 3

▶

test_data2

✔

0.068 s

OK
function result: 0

▶

test_data3

✔

0.068 s

OK
function result: 12

Code: 16:00:34 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

User test case 1:

[0, 1, 2]

User test case 2:

[5]

User test case 3:

[10, 1, 1, 1, 1, 1]

Analysis

expand all Example tests

▶

example1
example test

✔

0.068 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: 3

▶

test_data2

✔

0.068 s

OK
function result: 0

▶

test_data3

✔

0.068 s

OK
function result: 12

Code: 16:00:37 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

// 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)
    let circles = [];
    let count = 0;
    const LIMIT = 10000000;
    
    for (let i = 0; i < A.length; i++) {
        circles.push({
            id: i,
            start: i - A[i],
            end: i + A[i],
        })
    }
    circles.sort((a,b) => a.start - b.start);

    for (let i = 0; i < circles.length; i++) {
        let circle = circles[i];
        let j = i + 1;
        
        while (circles[j] && circle.end >= circles[j].start) {
            if (++count > LIMIT) {
                return -1;
            }
            j++;
        }
    }
    return count;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N*log(N)) or O(N)

expand all Example tests

▶

example1
example test

✔

0.076 s

expand all Correctness tests

▶

simple1

✔

0.068 s

▶

simple2

✔

0.068 s

▶

simple3

✔

0.068 s

▶

extreme_small
empty and [10]

✔

0.068 s

▶

small1

✔

0.068 s

▶

small2

✔

0.072 s

▶

small3

✔

0.068 s

▶

overflow
arithmetic overflow tests

✔

0.068 s

expand all Performance tests

▶

medium1

✔

0.080 s

▶

medium2

✔

0.108 s

▶

medium3

✔

0.108 s

▶

medium4

✔

0.152 s

▶

10M_intersections
10.000.000 intersections

✔

0.256 s

▶

big1

✔

0.200 s

0.068 s

▶

big2

✔

0.352 s

0.068 s

▶

big3
[0]*100.000

✔

0.292 s

0.068 s