Search
⌘K

Leetcode 728. Self Dividing Numbers

Generate all numbers in [left, right] whose nonzero digits each divide the number itself; for each candidate, iterate its digits, reject if any digit is 0 or number % digit != 0. Constraints are small (right ≤ 10^4), so a direct per-number digit check is sufficient.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.