Intermediate Algorithm Scripting: Sum All Primes - freeCodeCamp solution

sol.js

function sumPrimes(num) {

  let sum = 0;

  const isPrime = n => ![...Array(n).keys()].slice(2).map(i => !(n%i)).includes(true) && ![0,1].includes(n)

  for (let i=0; i<=num; i++) {
    if (isPrime(i)) {
      sum += i;
    }
  }

  return sum;
  
}