--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:

What is the nth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?

--hints--

lexicographicPermutations(699999) should return a number.

assert.isNumber(lexicographicPermutations(699999));

lexicographicPermutations(699999) should return 1938246570.

assert.strictEqual(lexicographicPermutations(699999), 1938246570);

lexicographicPermutations(899999) should return 2536987410.

assert.strictEqual(lexicographicPermutations(899999), 2536987410);

lexicographicPermutations(900000) should return 2537014689.

assert.strictEqual(lexicographicPermutations(900000), 2537014689);

lexicographicPermutations(999999) should return 2783915460.

assert.strictEqual(lexicographicPermutations(999999), 2783915460);

--seed--

--seed-contents--

function lexicographicPermutations(n) {

  return n;
}

lexicographicPermutations(999999);

--solutions--

// solution required