Leetcode 1067. Digit Count in Range

Count how many times each decimal digit appears in all integers within a given range (e.g., 1..n or low..high). This requires positional counting or digit-DP to handle large bounds efficiently and correctly account for leading zeros and edge cases.