Leetcode Problem 1015. Smallest Integer Divisible by K

1015. Smallest Integer Divisible by K

Leetcode Solutions

Check if k is a multiple of 2 or 5. If it is, return -1.
Initialize remainder to 1 and length_N to 1.
Create an empty set seen_remainders to track the remainders.
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.
If the loop finishes without finding a divisible n, return -1.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen