🚀

End of Year Sale: Use Coupon Code END2025 to Get Extra 25% Off.

12DAYS
:
11HOURS
:
26MINUTES
:
40SECONDS

Leetcode Problem 1015. Smallest Integer Divisible by K

1015. Smallest Integer Divisible by K

Leetcode Solutions

Key approach of the solution

  1. Check if k is a multiple of 2 or 5. If it is, return -1.
  2. Initialize remainder to 1 and length_N to 1.
  3. Create an empty set seen_remainders to track the remainders.
  4. Use a loop that runs at most k times: a. If remainder is 0, return length_N as the length of n. b. Calculate the new remainder by remainder * 10 + 1 modulo k. c. Increment length_N by 1. d. If the new remainder is already in seen_remainders, return -1. e. Add the new remainder to seen_remainders.
  5. If the loop finishes without finding a divisible n, return -1.
UML Thumbnail

Alternative approach using brute force

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...