Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3519. Count Numbers with Non-Decreasing Digits
Count how many integers in the inclusive string range [l, r] have non-decreasing digits when written in base b. This requires digit-DP / combinatorial counting over base-b digit sequences to handle large string bounds (length up to 100) and return 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.