freeCodeCamp/curriculum/challenges/arabic/08-coding-interview-prep/project-euler/problem-24-lexicographic-permutations.arabic.md

id	challengeType	title	videoUrl	localeTitle
5900f3841000cf542c50fe97	5	Problem 24: Lexicographic permutations

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert(lexicographicPermutations(699999) == 1938246570, "<code>lexicographicPermutations(699999)</code> should return 1938246570.");'
  - text: ''
    testString: 'assert(lexicographicPermutations(899999) == 2536987410, "<code>lexicographicPermutations(899999)</code> should return 2536987410.");'
  - text: ''
    testString: 'assert(lexicographicPermutations(900000) == 2537014689, "<code>lexicographicPermutations(900000)</code> should return 2537014689.");'
  - text: ''
    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