Leetcode 1977. Number of Ways to Separate Numbers

Count the number of ways to split the digit string into a sequence of positive integers (no leading zeros) that is non-decreasing, returning the count modulo 1e9+7. With length up to 3500, this requires DP over split positions plus efficient substring comparisons (e.g., LCP/rolling-hash) to enforce the non-decreasing constraint.