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

feat(seed): Added more assertions for Project Euler (#16078)

Browse Source
This commit is contained in:
Alvin Kristanto
2017-11-26 01:09:23 +07:00
committed by Quincy Larson
parent 98d8967b02
commit 79c5d96bac
1 changed files with 8 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1247,21 +1247,24 @@
"type": "bonfire", "type": "bonfire",
"title": "Problem 41: Pandigital prime", "title": "Problem 41: Pandigital prime",
"tests": [ "tests": [
"assert.strictEqual(euler41(), 7652413, 'message: <code>euler41()</code> should return 7652413.');" "assert(pandigitalPrime(4) == 4231, 'message: <code>pandigitalPrime(4)</code> should return 4231.');",
"assert(pandigitalPrime(5) == 0, 'message: <code>pandigitalPrime(5)</code> should return 0.');",
"assert(pandigitalPrime(6) == 0, 'message: <code>pandigitalPrime(6)</code> should return 0.');",
"assert(pandigitalPrime(7) == 7652413, 'message: <code>pandigitalPrime(7)</code> should return 7652413.');"
], ],
"solutions": [], "solutions": [],
"translations": {}, "translations": {},
"challengeSeed": [ "challengeSeed": [
"function euler41() {", "function pandigitalPrime(n) {",
" // Good luck!", " // Good luck!",
" return true;", " return n;",
"}", "}",
"", "",
"euler41();" "pandigitalPrime(7);"
], ],
"description": [ "description": [
"We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.", "We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime.",
"What is the largest n-digit pandigital prime that exists?" "What is the largest n-length digit pandigital prime that exists?"
] ]
}, },
{ {