Available question text
Return the k-th lexicographic permutation of [1..n] without generating all permutations — compute it directly by greedily selecting each digit using combinatorial block sizes (factorial number system) to skip groups of permutations.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 60. Permutation Sequence
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source