Question 72
All $n$-digit positive integers from $10^{n-1}$ to $10^n - 1$ are concatenated in the increasing order. What is the largest possible value of $k$ for which it is possible to find in this sequence of digits the same $k$-digit substring in at least two different places?