freeCodeCamp/problem-24-lexicographic-permutations.english.md at ce63de866cb47ef13145a9bb0caf8708b669a4e5

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.9 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3841000cf542c50fe97	5	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

tests:
  - text: <code>lexicographicPermutations(699999)</code> should return 1938246570.
    testString: assert(lexicographicPermutations(699999) == 1938246570, '<code>lexicographicPermutations(699999)</code> should return 1938246570.');
  - text: <code>lexicographicPermutations(899999)</code> should return 2536987410.
    testString: assert(lexicographicPermutations(899999) == 2536987410, '<code>lexicographicPermutations(899999)</code> should return 2536987410.');
  - text: <code>lexicographicPermutations(900000)</code> should return 2537014689.
    testString: assert(lexicographicPermutations(900000) == 2537014689, '<code>lexicographicPermutations(900000)</code> should return 2537014689.');
  - text: <code>lexicographicPermutations(999999)</code> should return 2783915460.
    testString: assert(lexicographicPermutations(999999) == 2783915460, '<code>lexicographicPermutations(999999)</code> should return 2783915460.');

Challenge Seed

function lexicographicPermutations(n) {
  // Good luck!
  return n;
}

lexicographicPermutations(999999);

Solution

// solution required

1.9 KiB Raw Blame History