Test results - Codility

Tasks Details

easy

1. EquiLeader

Find the index S such that the leaders of the sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N - 1] are the same.

Task Score

100%

Correctness

100%

Performance

100%

A non-empty array A consisting of N integers is given.

The leader of this array is the value that occurs in more than half of the elements of A.

An equi leader is an index S such that 0 ≤ S < N − 1 and two sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N − 1] have leaders of the same value.

For example, given array A such that:

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

we can find two equi leaders:

0, because sequences: (4) and (3, 4, 4, 4, 2) have the same leader, whose value is 4.

2, because sequences: (4, 3, 4) and (4, 4, 2) have the same leader, whose value is 4.

The goal is to count the number of equi leaders.

Write a function:

function solution(A);

that, given a non-empty array A consisting of N integers, returns the number of equi leaders.

For example, given:

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

the function should return 2, as explained above.

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

Notes

not defined yet

Code: 10:18:29 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: 10:18:32 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: 10:18:52 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)
}

function dominator(A) {
    
}

Code: 10:19:23 UTC, js, autosave

show code in pop-up

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

// 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)
}

function dominator(A) {
    let size = 0;
    let value = null;
    for (let i = 0; i <)
}

Code: 10:19:34 UTC, js, autosave

show code in pop-up

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

// 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)
}

function dominator(A) {
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        
    }
}

Code: 10:20:01 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        
    }
}

Code: 10:20:29 UTC, js, autosave

show code in pop-up

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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        }
    }
}

Code: 10:20: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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value =-=)
        }
    }
}

Code: 10:21:09 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
}

Code: 10:21:31 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
}

Code: 10:21:58 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
}

Code: 10:22:22 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    for (let i = 0; i < A.length; i++) {
        
    }
}

Code: 10:22:52 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
        }
    }
}

Code: 10:23: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 24 25 26 27 28 29 30 31 32 33

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
            
        }
    }
}

Code: 10:23:31 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            pos.push(i);
            countArray.push(count)
        }
    }
}

Code: 10:23:42 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            pos.push(i);
            countArray.push(++count);
        }
    }
}

Code: 10:24: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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            
            pos.push(i);
            countArray.push(++count);
        }
    }
}

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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
            countArray.push(++count);
        }
    }
}

Code: 10:24:34 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
}

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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    
}

Code: 10:27:38 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < )
}

Code: 10:27:59 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
}

Code: 10:28:30 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for
}

Code: 10:29: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 32 33 34 35 36 37

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; )
}

Code: 10:29: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 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)
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        
    }
}

Code: 10:29:38 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)
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = 
    }
}

Code: 10:29: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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1)/2
    }
}

Code: 10:30:03 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = 
    }
}

Code: 10:30: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 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = countArray.length-i-1
    }
}

Code: 10:30:30 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

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1)
    }
}

Code: 10:31: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 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)
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2
        if (countArray[i] > leftMin && )
    }
}

Code: 10:31:26 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 42 43

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2
        if (countArray[i] > leftMin && (counter-countArray[i]) > rightMin) {
            
        }
    }
}

Code: 10:31: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 32 33 34 35 36 37 38 39 40 41 42 43 44

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = [];
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2
        if (countArray[i] > leftMin && (counter-countArray[i]) > rightMin) {
            
        }
    }
}

Code: 10:32: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 32 33 34 35 36 37 38 39 40 41 42 43 44

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = [];
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (counter-countArray[i]) > rightMin) {
            
        }
    }
}

Code: 10:32: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 40 41 42 43 44 45

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (counter-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:32:22 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 42 43 44 45

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (counter-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.140 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

ReferenceError: counter is not defined
    at solution (solution.js:40:41)
    at solutionWrapper (/tmp/exec.js:402:28)
    at Promise.resolve.then (/tmp/exec.js:428:24)
    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: 10:32:33 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 42 43 44 45

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 2

0.072 s

WRONG ANSWER, got 5 expected 2

Code: 10:33:22 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 42 43 44 45 46

// 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 size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:33: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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:33:59 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 42 43 44 45 46 47 48

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

User test case 1:

[1]

User test case 2:

[1, 2]

User test case 3:

[1, 2, 1]

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 2

0.128 s

WRONG ANSWER, got 5 expected 2

expand all User tests

▶

test_data1

✔

0.128 s

OK
function result: 0

▶

test_data2

✔

0.128 s

OK
function result: 0

▶

test_data3

✔

0.128 s

OK
function result: 2

Code: 10:34: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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:34:26 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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    console.log(countArray);
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:34: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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(++count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    console.log(countArray);
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

User test case 1:

[1]

User test case 2:

[1, 2]

User test case 3:

[1, 2, 1]

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 5 expected 2

0.140 s

WRONG ANSWER, got 5 expected 2

stdout:

[ 2, 3, 5, 7, 9, 10 ]

expand all User tests

▶

test_data1

✔

0.128 s

OK
function result: 0

▶

test_data2

✔

0.128 s

OK
function result: 0

▶

test_data3

✔

0.140 s

OK
function result: 2

stdout:

[ 2, 3, 5 ]

Code: 10:34:42 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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    console.log(countArray);
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:34:43 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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    console.log(countArray);
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

User test case 1:

[1]

User test case 2:

[1, 2]

User test case 3:

[1, 2, 1]

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

[ 1, 1, 2, 3, 4, 4 ]

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: 0

▶

test_data2

✔

0.112 s

OK
function result: 0

▶

test_data3

✔

0.124 s

OK
function result: 0

stdout:

[ 1, 1, 2 ]

Code: 10:35: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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    console.log(countArray);
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:36:08 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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    console.log(countArray);
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

User test case 1:

[1]

User test case 2:

[1, 2]

User test case 3:

[1, 2, 1]

User test case 4:

[1, 1, 2, 1]

User test case 5:

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

Analysis

expand all Example tests

▶

example
example test

✔

0.080 s

stdout:

[ 1, 1, 2, 3, 4, 4 ]

expand all User tests

▶

test_data1

✔

0.076 s

OK
function result: 0

▶

test_data2

✔

0.072 s

OK
function result: 0

▶

test_data3

✔

0.076 s

OK
function result: 0

stdout:

[ 1, 1, 2 ]

▶

test_data4

✔

0.080 s

OK
function result: 2

stdout:

[ 1, 2, 2, 3 ]

▶

test_data5

✔

0.080 s

OK
function result: 7

stdout:

[ 1, 2, 3, 4, 5, 6, 7, 8 ]

Code: 10:36: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 42 43 44 45 46 47 48 49

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }

    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:37: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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Code: 10:37:18 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 42 43 44 45 46 47 48

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

User test case 1:

[1]

User test case 2:

[1, 2]

User test case 3:

[1, 2, 1]

User test case 4:

[1, 1, 2, 1]

User test case 5:

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

Analysis

expand all Example tests

▶

example
example test

✔

0.132 s

expand all User tests

▶

test_data1

✔

0.128 s

OK
function result: 0

▶

test_data2

✔

0.128 s

OK
function result: 0

▶

test_data3

✔

0.128 s

OK
function result: 0

▶

test_data4

✔

0.128 s

OK
function result: 2

▶

test_data5

✔

0.132 s

OK
function result: 7

Code: 10:37:27 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 42 43 44 45 46 47 48

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

User test case 1:

[1]

User test case 2:

[1, 2]

User test case 3:

[1, 2, 1]

User test case 4:

[1, 1, 2, 1]

User test case 5:

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

Analysis

expand all Example tests

▶

example
example test

✔

0.132 s

expand all User tests

▶

test_data1

✔

0.132 s

OK
function result: 0

▶

test_data2

✔

0.132 s

OK
function result: 0

▶

test_data3

✔

0.132 s

OK
function result: 0

▶

test_data4

✔

0.132 s

OK
function result: 2

▶

test_data5

✔

0.132 s

OK
function result: 7

Code: 10:37:31 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 42 43 44 45 46 47 48

// 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 < 2) {
        return 0;
    }
    let size = 0;
    let value = null;
    for (let i = 0; i < A.length; i++) {
        if (size === 0) {
            size++;
            value = A[i];
        } else {
            if (value === A[i]) {
                size++;
            } else {
                size--;
            }
        }
    }
    if (size <= 0) {
        return 0;
    }
    let pos = []
    let count = 0;
    let countArray = []
    for (let i = 0; i < A.length; i++) {
        if (A[i] === value) {
            count++;
            pos.push(i);
        }
        countArray.push(count);
    }
    if (count < A.length / 2.0) {
        return 0;
    }
    let equi = 0;
    for (let i = 0; i < countArray.length; i++) {
        const leftMin = (i+1) / 2;
        const rightMin = (countArray.length-i-1) / 2;
        if (countArray[i] > leftMin && (count-countArray[i]) > rightMin) {
            equi++;
        }
    }
    return equi;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.124 s

expand all Correctness tests

▶

single
single element

✔

0.124 s

▶

double
two elements

✔

0.124 s

▶

simple
simple test

✔

0.124 s

▶

small_random
small random test with two values, length = ~100

✔

0.124 s

▶

small
random + 200 * [MIN_INT] + random ,length = ~300

✔

0.124 s

expand all Performance tests

▶

large_random
large random test with two values, length = ~50,000

✔

0.184 s

▶

large
random(0,1) + 50000 * [0] + random(0, 1), length = ~100,000

✔

0.188 s

▶

large_range
1, 2, ..., N, length = ~100,000

✔

0.204 s

0.124 s

▶

extreme_large
all the same values

✔

0.224 s