highest-amount-of-divisors

const getDivisors = (num) => {
  const divisors = [1];
  for (let i = 2; i <= num; i++)
    if (num % i === 0 )
      divisors.push(i)
  return divisors;
}


function procArrInt(listNum) {
    let primeCounter = 0;
    let maxDivisors = 0;
    let maximumMembers = [];
    for (let i = 0, j = listNum.length; i <= j; i++){
      const divisors = getDivisors(listNum[i]);
      if (divisors.length === 2 )
        primeCounter++;
      if (divisors.length > maxDivisors){
        maxDivisors = divisors.length;
        maximumMembers = [listNum[i]];
        continue;
      }
      if (divisors.length === maxDivisors){
        maximumMembers.push(listNum[i]);
        continue;
      }
    }
      
    return [listNum.length,primeCounter, [maxDivisors,maximumMembers.sort((a,b) => a-b)] ];
}