# Nth Digit

Find thenthdigit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...

**Note:**\
nis positive and will fit within the range of a 32-bit signed integer (n< 231).

## Example

**Example 1:**

```
Input:

3

Output:

3
```

**Example 2:**

```
Input:
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.
```

## Note

see code

## Code

```java
class Solution {
    public int findNthDigit(int n) {
        long count = 9;
        int len = 1;
        int start = 1;
        while (n > count * len) {
            n -= count * len;
            len++;
            count *= 10; // 9*1 + 90 * 2 + 900 *3 + ... --> digits
            start *= 10;
        }

        start += (n - 1) / len; //start is 10/100/1000 minus 1 for begin with 9/99/999
        String s = Integer.toString(start);
        return Character.getNumericValue(s.charAt((n - 1) % len));
    }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://luj.gitbook.io/code/string/4-number/nth-digit.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.