Leetcode - Self Dividing Numbers Solution
1 min read

Leetcode - Self Dividing Numbers Solution

A self-dividing number is a number that is divisible by every digit it contains.

For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Also, a self-dividing number is not allowed to contain the digit zero.

Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.

Example 1:

left = 1, right = 22
Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]


  • The boundaries of each input argument are 1 <= left <= right <= 10000.

Solution in Python

class Solution:
    def isSelfDividing(num):
        for i in str(num):
            i = int(i)
            if i==0 or num%i!=0:
                return False
            return True
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        arr = []
        for i in range(left,right+1):
            if self.isSelfDividing(i):
        return arr

Enjoying these posts? Subscribe for more

Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.