Available question text
Find the k-th smallest integer in lexicographic order among [1, n]. Because n can be large (up to 10^9), the challenge is to traverse the implicit prefix tree of decimal representations and skip whole subtrees by counting how many numbers lie under each prefix instead of enumerating them.
Related questions
Continue with questions that share topics or the same question type.
- Last Substring in Lexicographical Order
Coding
- Return the Lexicographically Smallest Topological Order
Coding · Graphs · Heaps & Priority Queues
- A question around around array and number and SQL about counting employee salary and showing them in descending order
Coding
- Binary Tree Level Order Traversal
Coding
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 440. K-th Smallest in Lexicographical Order
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source