Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1416. Restore The Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source