Skip to content

Commit 0eb0a9b

Browse files
committed
👌 IMPROVE: Added Problem Statement
1 parent e7e5716 commit 0eb0a9b

File tree

1 file changed

+8
-0
lines changed

1 file changed

+8
-0
lines changed

Diff for: Project-Euler/Problem024.js

+8
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,11 @@
1+
/*
2+
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:
3+
4+
012 021 102 120 201 210
5+
6+
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
7+
*/
8+
19
function factorial(n) {
210
return n <= 1 ? 1 : n * factorial(n - 1)
311
}

0 commit comments

Comments
 (0)