Test results - Codility

Tasks Details

medium

1. MaxCounters

Calculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.

Task Score

100%

Correctness

100%

Performance

100%

You are given N counters, initially set to 0, and you have two possible operations on them:

increase(X) − counter X is increased by 1,

max counter − all counters are set to the maximum value of any counter.

A non-empty array A of M integers is given. This array represents consecutive operations:

if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X),

if A[K] = N + 1 then operation K is max counter.

For example, given integer N = 5 and array A such that:

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

the values of the counters after each consecutive operation will be:

(0, 0, 1, 0, 0) (0, 0, 1, 1, 0) (0, 0, 1, 2, 0) (2, 2, 2, 2, 2) (3, 2, 2, 2, 2) (3, 2, 2, 3, 2) (3, 2, 2, 4, 2)

The goal is to calculate the value of every counter after all operations.

Write a function:

function solution(N, A);

that, given an integer N and a non-empty array A consisting of M integers, returns a sequence of integers representing the values of the counters.

Result array should be returned as an array of integers.

For example, given:

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

the function should return [3, 2, 2, 4, 2], as explained above.

Write an efficient algorithm for the following assumptions:

N and M are integers within the range [1..100,000];

each element of array A is an integer within the range [1..N + 1].

Solution

Programming language used JavaScript

Time spent on task 41 minutes

Notes

not defined yet

Code: 14:53:22 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 N, int[] A) {
        // write your code in Java SE 8
    }
}

Code: 14:53:28 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;
    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];

        if (current <= N) {
            counters[current - 1]++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            for (let j = 0; j < N; j++) {
                counters[j] = max;
            }
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;
    
    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];

        if (current <= N) {
            counters[current - 1]++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            for (let j = 0; j < N; j++) {
                counters[j] = max;
            }
        }
    }

    return counters;
}

Code: 15:26:48 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let last

    for (let i = 0; i < M; i++) {
        const current = A[i];

        if (current <= N) {
            counters[current - 1]++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            for (let j = 0; j < N; j++) {
                counters[j] = max;
            }
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];

        if (current <= N) {
            counters[current - 1]++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxIndex = i;
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];

        if (current <= N) {
            if ()
            counters[current - 1]++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxIndex = i;
        }
    }

    return counters;
}

Code: 15:27:57 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxIndex) {
                
            }
            ++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxIndex = i;
        }
    }

    return counters;
}

Code: 15:28:08 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {

            }
            ++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxIndex = i;
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {

            }
            
        } else {
            lastMaxIndex = i;
        }
    }

    return counters;
}

Code: 15:28:29 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {

            }
            
        } else {
            lastMaxIndex = ;
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxIndex = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {

            }
            ++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxIndex = i;
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {

            }
            ++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        }
    }

    return counters;
}

Code: 15:29:01 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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {

            }
            ++;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            
        }
    }

    return counters;
}

Code: 15:29:25 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            if (currentCounter < max) {

            }
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if
            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            if (currentCounter < max) {

            }
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {
            
            }
            
            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            if (currentCounter < max) {

            }
        }
    }

    return counters;
}

Code: 15:30: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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {
                counters[current - 1] = max
            }

            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            if (currentCounter < max) {

            }
        }
    }

    return counters;
}

Code: 15:30:56 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {
                counters[current - 1] = max
            }

            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            if (currentCounter < max) {

            }
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < max) {
                counters[current - 1] = max
            }

            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    return counters;
}

Code: 15:31: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 29 30 31 32 33 34 35

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            }

            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < )
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            }

            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [2, 2, 2, 4, 2] expected [3, 2, 2, 4, 2]

0.072 s

WRONG ANSWER, got [2, 2, 2, 4, 2] expected [3, 2, 2, 4, 2]

Code: 15:32: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 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                
            }

            counters[current - 1] = currentCounter + 1;

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let max = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let curmax = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Code: 15:33:01 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let currentMax = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > max) {
                max =  counters[current - 1];
            }
        } else {
            lastMaxCounter = max;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Code: 15:33:13 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(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let currentMax = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > currentMax) {
                currentMax =  counters[current - 1];
            }
        } else {
            lastMaxCounter = currentMax;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let currentMax = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > currentMax) {
                currentMax =  counters[current - 1];
            }
        } else {
            lastMaxCounter = currentMax;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.068 s

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let currentMax = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > currentMax) {
                currentMax =  counters[current - 1];
            }
        } else {
            lastMaxCounter = currentMax;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.068 s

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

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

function solution(N, A) {
    const counters = new Array(N).fill(0);
    const M = A.length;

    let currentMax = 0;
    let lastMaxCounter = 0;

    for (let i = 0; i < M; i++) {
        const current = A[i];
        const currentCounter = counters[current - 1];

        if (current <= N) {
            if (currentCounter < lastMaxCounter) {
                counters[current - 1] = lastMaxCounter + 1;
            } else {
                counters[current - 1] = currentCounter + 1;
            }

            if (counters[current - 1] > currentMax) {
                currentMax =  counters[current - 1];
            }
        } else {
            lastMaxCounter = currentMax;
        }
    }

    for (let i = 0; i < N; i++) {
        if (counters[i] < lastMaxCounter) {
            counters[i] = lastMaxCounter;
        }
    }

    return counters;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

expand all Example tests

▶

example
example test

✔

0.068 s

expand all Correctness tests

▶

extreme_small
all max_counter operations

✔

0.068 s

▶

single
only one counter

✔

0.068 s

▶

small_random1
small random test, 6 max_counter operations

✔

0.068 s

▶

small_random2
small random test, 10 max_counter operations

✔

0.068 s

expand all Performance tests

▶

medium_random1
medium random test, 50 max_counter operations

✔

0.068 s

▶

medium_random2
medium random test, 500 max_counter operations

✔

0.072 s

▶

large_random1
large random test, 2120 max_counter operations

✔

0.104 s

▶

large_random2
large random test, 10000 max_counter operations

✔

0.124 s

▶

extreme_large
all max_counter operations

✔

0.136 s

0.124 s