Hello Everyone.

This was asked to me in an Interview today.

```
You are given two numbers N and K. Find count of all non - negative integers
less than N whose sum of digits are divisible by K modulo 10^9 + 7.
N can be very large (Taken as a string).
```

I think it is a digit DP Problem Can anyone help me with some similar problem or how can we solve this specific problem since I am not familiar with Digit DP.

Thanks in advance. @galencolin @ssrivastava990 @vijju123 @taran_1407