> For the complete documentation index, see [llms.txt](https://anand-aryan.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://anand-aryan.gitbook.io/leetcode/306.-additive-number.md).

# 306. Additive Number

Additive number is a string whose digits can form additive sequence.

A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.

For example: "112358" is an additive number because the digits can form an additive sequence: 1, 1, 2, 3, 5, 8. 1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8 "199100199" is also an additive number, the additive sequence is: 1, 99, 100, 199. 1 + 99 = 100, 99 + 100 = 199

Note: Numbers in the additive sequence cannot have leading zeros, so sequence 1, 2, 03 or 1, 02, 3 is invalid.

Given a string containing only digits '0'-'9', write a function to determine if it's an additive number.

Follow up: How would you handle overflow for very large input integers?

Credits:Special thanks to @jeantimex for adding this problem and creating all test cases.

## Solution <a href="#solution" id="solution"></a>

```java
public class Solution {
    public boolean isAdditiveNumber(String num) {
        if (num == null || num.length() == 0) return false;
        int size = num.length();

        for(int i = 1; i <= size-1; i ++) {
            String first = num.substring(0, i);
            if (first.charAt(0) == '0' && first.length() >= 2) {
                break;
            }

            for(int j = i+1; j < size; j ++) {
                String second = num.substring(i, j);
                if (second.charAt(0) == '0' && second.length() >=2) {
                    break;
                }

                if (verify(num, j, Long.valueOf(first), Long.valueOf(second))) {
                    return true;
                }
            }
        }

        return false;
    }

    private boolean verify(String num, int startIndex, long first, long second) {
        if (startIndex > num.length()) {
            return false;
        }

        if (startIndex == num.length()) {
            return true;
        }


        long next = first + second;
        String nextString = String.valueOf(next);
        if (num.substring(startIndex).contains(nextString)) {
            return verify(num, startIndex + nextString.length(), second, next);
        } else {
            return false;
        }

    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## 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://anand-aryan.gitbook.io/leetcode/306.-additive-number.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.