Leetcode 2719. Count of Integers

Count how many integers in the inclusive range [num1, num2] (given as strings) have a digit-sum between min_sum and max_sum; this is solved with digit-DP over the string bounds tracking the running digit sum (≤400) and tight states, returning the result modulo 1e9+7.