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

Leetcode solutions MLP Feature Image

Question

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 == 0128 % 2 == 0, and 128 % 8 == 0.

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].

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 <= 104

Python Solution

class Solution:
    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
        def checker(n):
            x=str(n)
            for i in x:
                if i=='0':
                    return False
                if n%int(i)!=0:
                    return False
            return True
        l=[]
        for k in range(left,right+1):
            if checker(k):
                l.append(k)
        return (l)

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top