Permutation Sequence · Coding Interview Practice

Permutation SequenceThe numbers 1 to n form n! permutations in lexicographic order. Return the kth permutation, using factorials rather than enumerating them.Constraints

1 <= n <= 9

1 <= k <= n!

Examples

Input: n = 3, k = 3 Output: "213"

Input: n = 4, k = 9 Output: "2314"

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…