Leetcode 1015. Smallest Integer Divisible by K

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.