1015. Smallest Integer Divisible by K

Medium

1.1K

843

Given a positive integer `k`

, you need to find the **length** of the **smallest** positive integer `n`

such that `n`

is divisible by `k`

, and `n`

only contains the digit `1`

.

Return *the length of *

`n`

. If there is no such `n`

, return -1.**Note:** `n`

may not fit in a 64-bit signed integer.

**Example 1:**

Input:k = 1Output:1Explanation:The smallest answer is n = 1, which has length 1.

**Example 2:**

Input:k = 2Output:-1Explanation:There is no such positive integer n divisible by 2.

**Example 3:**

Input:k = 3Output:3Explanation:The smallest answer is n = 111, which has length 3.

**Constraints:**

`1 <= k <= 10`

^{5}

Accepted

59.5K

Submissions

126.9K

Acceptance Rate

46.8%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved