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:

class Solution { public int[] solution(int N, int[] 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 Java 8

Time spent on task 5 minutes

Notes

not defined yet

Task timeline

Code: 13:16:01 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: 13:16:07 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

// 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
        int B[] = new int [N];
        int counter = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                for(int j=0; j<B.length; j++){
                    B[j] = counter;
                }
            } else {
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:16:17 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int[] solution(int N, int[] A) {
        // write your code in Java SE 8
        int B[] = new int [N];
        int counter = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = 
                }
            } else {
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:16:35 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
                }
            } else {
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:16:57 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
                
            } else {
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:17:16 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if()
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:17:27 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] <= )
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:17:51 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:18:02 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        return B;
    }
}

Code: 13:19:00 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
            
            
        }
        return B;
    }
}

Code: 13:19:30 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        
        for (int i=0; i<B.length ; i++){
            if(B[i] < curMa)
        }
        return B;
    }
}

Code: 13:19:40 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        
        for (int i=0; i<B.length ; i++){
            if(B[i] < curMax)
        }
        return B;
    }
}

Code: 13:19:59 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        
        for (int i=0; i<B.length ; i++){
            if(B[i] < curMax){
                B[i] = curMax;
            }
        }
        return B;
    }
}

Code: 13:20:02 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        
        for (int i=0; i<B.length ; i++){
            if(B[i] < curMax){
                B[i] = curMax;
            }
        }
        return B;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.008 s

Code: 13:20:14 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        
        for (int i=0; i<B.length ; i++){
            if(B[i] < curMax){
                B[i] = curMax;
            }
        }
        return B;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.004 s

Code: 13:20:18 UTC, java, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

// 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
        int B[] = new int [N];
        int counter = 0;
        int curMax = 0;
        
        for(int i=0; i<B.length; i++){
            B[i] = 0;
        }
        
        for(int i=0 ; i<A.length ; i++){
            
            if(A[i]==N+1){
                curMax = counter;
            } else {
                if(B[A[i]-1] < curMax){
                    B[A[i]-1] = curMax;
                }
                B[A[i]-1] ++;
                counter = Math.max(B[A[i]-1],counter);
            }
        }
        
        for (int i=0; i<B.length ; i++){
            if(B[i] < curMax){
                B[i] = curMax;
            }
        }
        return B;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

expand all Example tests

▶

example
example test

✔

0.004 s

expand all Correctness tests

▶

extreme_small
all max_counter operations

✔

0.004 s

▶

single
only one counter

✔

0.004 s

▶

small_random1
small random test, 6 max_counter operations

✔

0.004 s

▶

small_random2
small random test, 10 max_counter operations

✔

0.004 s

expand all Performance tests

▶

medium_random1
medium random test, 50 max_counter operations

✔

0.020 s

▶

medium_random2
medium random test, 500 max_counter operations

✔

0.020 s

▶

large_random1
large random test, 2120 max_counter operations

✔

0.400 s

▶

large_random2
large random test, 10000 max_counter operations

✔

0.564 s

▶

extreme_large
all max_counter operations

✔

1.308 s

1.204 s