Medium

Quiz

#400 Nth Digit

APPROACH

Write all positive integers one after another to form the infinite digit string "123456789101112131415...". Given an integer n, return the digit at position n in this string (using 1-based indexing).

Example 1:

Input: n = 3

Output: 3

Example 2:

Input: n = 11

Output: 0

Explanation: The 11th digit of the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... is a 0, which is part of the number 10.

1 of 4

1:00

What is the optimal approach for this problem?