You are given an integer n. Consider the infinite sequence formed by writing all positive integers in order and concatenating their decimal representations: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, .... Return the digit located at the $n$th position in this sequence, using $1$ based indexing.

Implement int findNthDigit(int n) to return that digit.

Constraints:

• $1 \leq$ n $\leq 2^{31} - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.