Counting a Digit — Solution & Editorial

Back to the Problem

Position-by-position counting: split N around each digit position into (high, current, low) and count how often D occupies that position; D = 0 needs the leading-zero adjustment.

Complexity: O(log N)

Watch out: Zero never appears as a leading digit — its count needs the high > 0 correction.