Sum of digits to n
Compute the sum of the decimal digits of every integer from 1 to n inclusive. For example for n = 12 the total is (1)+(2)+...+(9)+(1+0)+(1+1)+(1+2) = 51. Return the total. 1 <= n <= 10^12.
Implement
total_digit_sum(n: int) → intExamples
in
[12]out51What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[12]51not run yetsample