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:

def 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 Python

Time spent on task 21 minutes

Notes

not defined yet

Code: 11:21: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 N, int[] A) {
        // Implement your solution here
    }
}

Code: 11:26:14 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N, A):
    # Implement your solution here
    pass

Code: 11:26:24 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr = [max_val] * N
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    # print(arr)
    return arr

Code: 11:27:24 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr = [max_val] * 
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    # print(arr)
    return arr

Code: 11:27:48 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for val in A:
        if 
    # print(arr)
    return arr

Code: 11:28:02 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for val in arr:
        if arr[]
    # print(arr)
    return arr

Code: 11:28:16 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[]
    # print(arr)
    return arr

Code: 11:28:36 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    # print(arr)
    return arr

Code: 11:28:38 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.016 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 131, in <module>
    main()
  File "exec.py", line 107, in main
    result = solution( N, A )
  File "/tmp/exec_user__uhu1jfr/solution.py", line 7, in solution
    arr[val-1] = max_val
IndexError: list assignment index out of range

Code: 11:29:23 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        if:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:29:35 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        if val <= N:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:29:50 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            arr[val-1] = max_val
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:30:06 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:30:06 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])

    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.016 s

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

Code: 11:30:32 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.020 s

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

stdout:

[1, 0, 1, 4, 0]

Code: 11:31:29 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr,)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:31:40 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, max_val)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:32:08 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, max_val)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.016 s

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

stdout:

[1, 0, 1, 4, 0] 4

Code: 11:32:32 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, max_val)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:32:51 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    set_max = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            set_max = max_val
            # continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, max_val)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:33:05 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    set_max = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            set_max = max_val
            # continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, set_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:33:06 UTC, py, 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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    set_max = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            set_max = max_val
            # continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, set_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.020 s

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

stdout:

[1, 0, 1, 4, 0] 2

Code: 11:33:49 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            set_max = max_val
            # continue
        else:
            arr[val-1] += 1
            max_val = max(max_val, arr[val-1])
    print(arr, set_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:34:09 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            # arr[val-1] = max_val
            set_max = max_val
            # continue
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, set_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:34:24 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, set_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:34:35 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:35:34 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] += max_val
    return arr

Code: 11:35:36 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] += max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.020 s

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

Code: 11:36:26 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:36:27 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.020 s

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

Code: 11:36:56 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:36:58 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur_ma)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.016 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 131, in <module>
    main()
  File "exec.py", line 107, in main
    result = solution( N, A )
  File "/tmp/exec_user_ga0et1uf/solution.py", line 12, in solution
    print(arr, max_val, cur_ma)
NameError: name 'cur_ma' is not defined

Code: 11:37:08 UTC, py, verify, result: Failed

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✘

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

0.020 s

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

stdout:

[1, 0, 1, 4, 0] 2 4

Code: 11:40:16 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:40:28 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            if arr[val-1] < max_val:
                
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:40:48 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            if arr[val-1] < max_val:
                arr[val-1] = max_val
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:41:11 UTC, py, 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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            if arr[val-1] < max_val:
                arr[val-1] = max_val
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    print(arr, max_val, cur_max)
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✔

0.020 s

stdout:

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

Code: 11:41:20 UTC, py, autosave

show code in pop-up

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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            if arr[val-1] < max_val:
                arr[val-1] = max_val
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Code: 11:41:22 UTC, py, 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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            if arr[val-1] < max_val:
                arr[val-1] = max_val
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis

expand all Example tests

▶

example
example test

✔

0.016 s

Code: 11:41:26 UTC, py, 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

def solution(N, A):
    # Implement your solution here
    arr = [0] * N
    max_val = 0
    cur_max = 0
    for val in A:
        if val > N:
            max_val = cur_max
        else:
            if arr[val-1] < max_val:
                arr[val-1] = max_val
            arr[val-1] += 1
            cur_max = max(cur_max, arr[val-1])
    for idx in range(N):
        if arr[idx] < max_val:
            arr[idx] = max_val
    return arr

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N + M)

expand all Example tests

▶

example
example test

✔

0.020 s

expand all Correctness tests

▶

extreme_small
all max_counter operations

✔

0.016 s

▶

single
only one counter

✔

0.020 s

▶

small_random1
small random test, 6 max_counter operations

✔

0.020 s

▶

small_random2
small random test, 10 max_counter operations

✔

0.020 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.060 s

▶

large_random2
large random test, 10000 max_counter operations

✔

0.120 s

▶

extreme_large
all max_counter operations

✔

0.108 s

0.140 s