C# labTests and others: CODILITY.COM - LESSON 2

THE PROBLEM

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 zero-indexed 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.

Assume that:

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].

MY SOLUTION (88% - 100% results, 80% performance, time complexity O(n+M))

using System;

using System.Collections.Generic;

using System.Linq;

class Solution {

    public int[] solution(int N, int[] A) {

        int l = A.Length;

        int [] result = new int [N];

        int maxCounter=0;                

        for (int i=0; i<l; i++)

{

           if (A[i]>=1 && A[i]<=N)        

{

                result[A[i]-1] +=1;

                if ((result[A[i]-1]) > maxCounter)    

                     maxCounter = result[A[i]-1];        

}

           if (A[i] == N+1)

{

             for (int j=0; j<N; j++) result[j] = maxCounter;              

}

}

        return result;        

}

}

There is one performance test that fails:

extreme_large
all max_counter operations

>6.000 s

TIMEOUT ERROR
running time: >6.00 sec., time limit: 0.49 sec.

C# labTests and others