--- id: 5900f3841000cf542c50fe97 challengeType: 5 title: 'Problem 24: Lexicographic permutations' --- ## 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
```yml tests: - text: lexicographicPermutations(699999) should return 1938246570. testString: assert(lexicographicPermutations(699999) == 1938246570, 'lexicographicPermutations(699999) should return 1938246570.'); - text: lexicographicPermutations(899999) should return 2536987410. testString: assert(lexicographicPermutations(899999) == 2536987410, 'lexicographicPermutations(899999) should return 2536987410.'); - text: lexicographicPermutations(900000) should return 2537014689. testString: assert(lexicographicPermutations(900000) == 2537014689, 'lexicographicPermutations(900000) should return 2537014689.'); - text: lexicographicPermutations(999999) should return 2783915460. testString: assert(lexicographicPermutations(999999) == 2783915460, 'lexicographicPermutations(999999) should return 2783915460.'); ```
## Challenge Seed
```js function lexicographicPermutations(n) { // Good luck! return n; } lexicographicPermutations(999999); ```
## Solution
```js // solution required ```