Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.