You are given two integers, l and r, represented as strings, and an integer b. Return the count of integers in the inclusive range [l, r] whose digits are in non-decreasing order when represented in base b.
An integer is considered to have non-decreasing digits if, when read from left to right (from the most significant digit to the least significant digit), each digit is greater than or equal to the previous one.
Since the answer may be too large, return it modulo 109 + 7.
Example 1:
Input: l = "23", r = "28", b = 8
Output: 3
Explanation:
Example 2:
Input: l = "2", r = "7", b = 2
Output: 2
Explanation:
Constraints:
1 <= l.length <= r.length <= 1002 <= b <= 10l and r consist only of digits.l is less than or equal to the value represented by r.l and r do not contain leading zeros.Solutions for this problem are being prepared.
Try solving it yourselfPractice Count Numbers with Non-Decreasing Digits with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor