440. K-th Smallest in Lexicographical Order

Hard

683

80

Given two integers `n`

and `k`

, return *the* `k`

^{th}*lexicographically smallest integer in the range* `[1, n]`

.

**Example 1:**

Input:n = 13, k = 2Output:10Explanation:The lexicographical order is [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9], so the second smallest number is 10.

**Example 2:**

Input:n = 1, k = 1Output:1

**Constraints:**

`1 <= k <= n <= 10`

^{9}

Accepted

19.7K

Submissions

63.5K

Acceptance Rate

31.1%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved