Boolean
CodeChefOpen on judge ↗
The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By listing and labelling all of the permutations in order, we get the following sequence for n = 3: "123" "132" "213" "231" "312" "321" Given n and k, return the kth permutation sequence. ### Input Given $n$ and $k$ ### Output Print the $kth$ permutation sequence. ### Constraints - $1 \leq n \leq 9$ - $1 \leq k \leq n!
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start