Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Count Non Decreasing Arrays With Given Digit Sums
Coding · Array · Dynamic Programming · Prefix Sum
- Count Non-Decreasing Subarrays After K Operations
Coding
- Count Numbers with Unique Digits
Coding
- Count Numbers With Unique Digits II
Coding
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 3519. Count Numbers with Non-Decreasing Digits
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source