100% solution for Max Counters Task on Codility

MaxCounters.js

function solution(N, A) {
  var B = new Array(N);
  B.fill(0, 0, N);
  var max = 0;

  for (let i = 0; i < A.length; i++) {
    if (A[i] == N + 1) {
        if(A[i+1] == N+1){
            continue;
        } else{
      for(var j = 0; j< B.length;j++){
          B[j]=max;
      }}
    } else {
      B[A[i] - 1]++;
      if (B[A[i] - 1] > max) max = B[A[i] - 1];
    }
  }
  return B;
}