Champernowne Word
The Champernowne word 1234567891011121314151617181920212223…, also known as the counting series, is an infinitely long string of digits made up of all positive integers written out in ascending order without any separators. This function should return the digit at position n of the Champernowne word. Position counting again starts from zero.
Input: Integer (int).
Output: Integer (int).
Examples:
assert counting_series(0) == 1 assert counting_series(10) == 0 assert counting_series(100) == 5
The mission was taken from Python CCPS 109. It is taught for Ryerson Chang School of Continuing Education by Ilkka Kokkarinen
