Leetcode 1416. Restore The Array

Count the number of ways to split a digit string s (no leading zeros) into integers in [1, k], returning the count modulo 1e9+7. This is typically solved with dynamic programming, only considering substrings up to the digit-length of k and rejecting parts with leading zeros or value > k.