6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.8 KiB
1.8 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3841000cf542c50fe97 | 5 | Problem 24: Lexicographic permutations | 301885 |
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:
012 021 102 120 201 210
What is the nth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
Instructions
Tests
tests:
- text: <code>lexicographicPermutations(699999)</code> should return a number.
testString: assert(typeof lexicographicPermutations(699999) === 'number');
- text: <code>lexicographicPermutations(699999)</code> should return 1938246570.
testString: assert(lexicographicPermutations(699999) == 1938246570);
- text: <code>lexicographicPermutations(899999)</code> should return 2536987410.
testString: assert(lexicographicPermutations(899999) == 2536987410);
- text: <code>lexicographicPermutations(900000)</code> should return 2537014689.
testString: assert(lexicographicPermutations(900000) == 2537014689);
- text: <code>lexicographicPermutations(999999)</code> should return 2783915460.
testString: assert(lexicographicPermutations(999999) == 2783915460);
Challenge Seed
function lexicographicPermutations(n) {
// Good luck!
return n;
}
lexicographicPermutations(999999);
Solution
// solution required