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

fix(challenges): Edit challengeSeed and Add Solution for Project Euler 49 (#17146)

Browse Source 
Changed the name of the function in the challengeSeed from euler49 to the
challenge name. Also added a solution that @elliotjz contributed to the
fCC Arcade Mode.

BREAKING CHANGE: None
This commit is contained in:
Kristofer Koishigawa
2018-05-12 06:23:28 +09:00
committed by mstellaluna
parent 080c27e7cb
commit b7be885c73
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1713,17 +1713,17 @@
"type": "bonfire", "type": "bonfire",
"title": "Problem 49: Prime permutations", "title": "Problem 49: Prime permutations",
"tests": [ "tests": [
"assert.strictEqual(euler49(), 296962999629, 'message: <code>euler49()</code> should return 296962999629.');" "assert.strictEqual(primePermutations(), 296962999629, 'message: <code>primePermutations()</code> should return 296962999629.');"
], ],
"solutions": [], "solutions": ["function primePermutations() {\n function arePermutations(num1, num2) {\n const numStr1 = num1.toString();\n let numStr2 = num2.toString();\n if (numStr1.length !== numStr2.length) {\n return false;\n }\n\n for (let i = 0; i < numStr1.length; i++) {\n const index = numStr2.indexOf(numStr1[i]);\n if (index === -1) {\n return false;\n }\n numStr2 = numStr2.slice(0, index) + numStr2.slice(index + 1);\n }\n return true;\n }\n\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\n for (let num1 = 1000; num1 <= 9999; num1++) {\n const num2 = num1 + 3330;\n const num3 = num2 + 3330;\n if (isPrime(num1) && isPrime(num2) && isPrime(num3)) {\n if (arePermutations(num1, num2) && arePermutations(num1, num3)\n && num1 !== 1487) {\n // concatenate and return numbers\n return (num1 * 100000000) + (num2 * 10000) + num3;\n }\n }\n }\n return 0;\n}"],
"translations": {}, "translations": {},
"challengeSeed": [ "challengeSeed": [
"function euler49() {", "function primePermutations() {",
" // Good luck!", " // Good luck!",
" return true;", " return true;",
"}", "}",
"", "",
"euler49();" "primePermutations();"
], ],
"description": [ "description": [
"The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.", "The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permutations of one another.",