<reponame>Next-Gen-UI/Code-Dynamics<filename>Leetcode/0728. Self Dividing Numbers/0728.py
class Solution:
  def selfDividingNumbers(self, left: int, right: int) -> List[int]:
    return [num for num in range(left, right + 1) if all(n != 0 and num % n == 0 for n in map(int, str(num)))]

Self Dividing Numbers/0728.py
class Solution:
  def selfDividingNumbers(self, left: int, right: int) -> List[int]:
    return [num for num in range(left, right + 1) if all(n != 0 and num % n == 0 for n in map(int, str(num)))]