freeCodeCamp/problem-24-lexicographic-permutations.english.md at 92377cf71af628cb5ea6b28ff7d6fa66a9b52449

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.8 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

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

1.8 KiB Raw Blame History