AlgoDaily Solution

1var assert = require('assert');
2
3function sumOfPrimes(n) {
4  const numsLessThanN = Array.from({ length: n + 1 }, function (val, idx) {
5    return idx;
6  }).slice(2);
7
8  const primes = numsLessThanN.filter((num) => {
9    let primeCandidate = num - 1;
10
11    while (primeCandidate > 1 && primeCandidate >= Math.sqrt(num)) {
12      if (num % primeCandidate === 0) return false;
13      primeCandidate--;
14    }
15
16    return true;
17  });
18
19  return primes.reduce((prime1, prime2) => prime1 + prime2);
20}
21
22try {
23  assert.deepEqual(2, sumOfPrimes(2), 'sumOfPrimes(2) should equal 2');
24
25  console.log('PASSED: ' + '`sumOfPrimes(2)` should equal `2`');
26} catch (err) {
27  console.log(err);
28}
29
30try {
31  assert.deepEqual(129, sumOfPrimes(30), 'sumOfPrimes(30) should equal 129');
32
33  console.log('PASSED: ' + '`sumOfPrimes(30)` should equal `129`');
34} catch (err) {
35  console.log(err);
36}
37
38try {
39  assert.deepEqual(381, sumOfPrimes(55), 'sumOfPrimes(55) should equal 381');
40
41  console.log('PASSED: ' + '`sumOfPrimes(55)` should equal `381`');
42} catch (err) {
43  console.log(err);
44}

Community Solutions

Community solutions are only available for premium users.

Access all course materials today

The rest of this tutorial's contents are only available for premium members. Please explore your options at the link below.

Returning members can login to stop seeing this.

JAVASCRIPT
OUTPUT
Results will appear here.