# Leetcode 728 - Self Dividing Numbers

`Note:`

- Classic uses of % and / to get the least significant digit and shorten the num by 1 digit.

`Question:`

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.

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

`Example:`

1 | Input: left = 1, right = 22 |

`Code:`

1 | /** |