Available question text
Find the minimum length L such that the repunit (a number consisting of L copies of digit '1') is divisible by k, returning -1 if no such repunit exists (no solution when k has factor 2 or 5). The core challenge is detecting divisibility by tracking remainders/cycles rather than constructing the huge number.
Related questions
Continue with questions that share topics or the same question type.
- Find Nth Smallest Integer With K One Bits
Coding · Bit Manipulation · Combinatorics · Math
- K-th Smallest Remaining Even Integer in Subarray Queries
Coding
- Smallest Divisible Digit Product I
Coding
- Smallest Divisible Digit Product II
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 1015. Smallest Integer Divisible by K
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source