https://leetcode.com/problems/find-the-k-beauty-of-a-number/


Success


```python
class Solution:
    def divisorSubstrings(self, num: int, k: int) -> int:
        counting = 0
        for index, _ in enumerate(str(num)):
            if index + k <= len(str(num)):
                value = int(str(num)[index:index+k])
                if (value != 0) and (num % value == 0):
                    #print(value)
                    counting += 1
        return counting
```
