Practice Self Dividing Numbers
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
A self-dividing number is a number that is divisible by every digit it contains. A self-dividing number is not allowed to contain the digit zero. Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right] (both inclusive).
Source: Self Dividing Numbers on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
left = 1, right = 22
Output
[1,2,3,4,5,6,7,8,9,11,12,15,22]
# Example 2
Input
left = 47, right = 85
Output
[48,55,66,77]
Constraints
1 <= left <= right <= 10^4
Related LeetCode Problems
Practice more problems similar to Self Dividing Numbers.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.