gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix(challenges): Add Tests and Solution for Project Euler 50 (#17152)

Browse Source 
Added an additional test and a solution adapted from the one
@elliotjz contributed to the fCC Arcade Mode.

BREAKING CHANGE: None
This commit is contained in:
Kristofer Koishigawa
2018-05-14 23:12:04 +09:00
committed by Stuart Taylor
parent 9a8fc6bf69
commit 28eacebaf9
1 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
challenges/08-coding-interview-questions-and-take-home-assignments/project-euler-problems.json
View File

@ -1742,17 +1742,18 @@
"type": "bonfire", "type": "bonfire",
"title": "Problem 50: Consecutive prime sum", "title": "Problem 50: Consecutive prime sum",
"tests": [ "tests": [
"assert.strictEqual(euler50(), 997651, 'message: <code>euler50()</code> should return 997651.');" "assert.strictEqual(consecutivePrimeSum(1000), 953, 'message: <code>consecutivePrimeSum(1000)</code> should return 953.');",
"assert.strictEqual(consecutivePrimeSum(1000000), 997651, 'message: <code>consecutivePrimeSum(1000000)</code> should return 997651.');"
], ],
"solutions": [], "solutions": ["function consecutivePrimeSum(limit) {\n function isPrime(num) {\n if (num < 2) {\n return false;\n } else if (num === 2) {\n return true;\n }\n const sqrtOfNum = Math.floor(num ** 0.5);\n for (let i = 2; i <= sqrtOfNum + 1; i++) {\n if (num % i === 0) {\n return false;\n }\n }\n return true;\n }\n function getPrimes(limit) {\n const primes = [];\n for (let i = 0; i <= limit; i++) {\n if (isPrime(i)) primes.push(i);\n }\n return primes;\n }\n\n const primes = getPrimes(limit);\n let primeSum = [...primes];\n primeSum.reduce((acc, n, i) => {\n primeSum[i] += acc;\n return acc += n;\n }, 0);\n\n for (let j = primeSum.length - 1; j >= 0; j--) {\n for (let i = 0; i < j; i++) {\n const sum = primeSum[j] - primeSum[i];\n if (sum > limit) break;\n if (isPrime(sum) && primes.indexOf(sum) > -1) return sum;\n }\n }\n}"],
"translations": {}, "translations": {},
"challengeSeed": [ "challengeSeed": [
"function euler50() {", "function consecutivePrimeSum(limit) {",
" // Good luck!", " // Good luck!",
" return true;", " return true;",
"}", "}",
"", "",
"euler50();" "consecutivePrimeSum(1000000);"
], ],
"description": [ "description": [
"The prime 41, can be written as the sum of six consecutive primes:", "The prime 41, can be written as the sum of six consecutive primes:",