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

feat(seed): Added more assertion for problem twenty four (#15850)

Browse Source
This commit is contained in:
Alvin Kristanto
2017-09-12 09:39:28 +07:00
committed by Quincy Larson
parent b278a59139
commit 26c8dcdd15
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

@ -736,22 +736,25 @@
"type": "bonfire", "type": "bonfire",
"title": "Problem 24: Lexicographic permutations", "title": "Problem 24: Lexicographic permutations",
"tests": [ "tests": [
"assert.strictEqual(euler24(), 2783915460, 'message: <code>euler24()</code> should return 2783915460.');" "assert(lexicographicPermutations(699999) == 1938246570, 'message: <code>lexicographicPermutations(699999)</code> should return 1938246570.');",
"assert(lexicographicPermutations(899999) == 2536987410, 'message: <code>lexicographicPermutations(899999)</code> should return 2536987410.');",
"assert(lexicographicPermutations(900000) == 2537014689, 'message: <code>lexicographicPermutations(900000)</code> should return 2537014689.');",
"assert(lexicographicPermutations(999999) == 2783915460, 'message: <code>lexicographicPermutations(999999)</code> should return 2783915460.');"
], ],
"solutions": [], "solutions": [],
"translations": {}, "translations": {},
"challengeSeed": [ "challengeSeed": [
"function euler24() {", "function lexicographicPermutations(n) {",
" // Good luck!", " // Good luck!",
" return true;", " return n;",
"}", "}",
"", "",
"euler24();" "lexicographicPermutations(999999);"
], ],
"description": [ "description": [
"A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:", "A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:",
"012   021   102   120   201   210", "012   021   102   120   201   210",
"What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?" "What is the n-th lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?"
] ]
}, },
{ {