<p>You are given a string of digits <code>num</code>, such as <code>&quot;123456579&quot;</code>. We can split it into a Fibonacci-like sequence <code>[123, 456, 579]</code>.</p>

<p>Formally, a <strong>Fibonacci-like</strong> sequence is a list <code>f</code> of non-negative integers such that:</p>

<ul>
	<li><code>0 &lt;= f[i] &lt; 2<sup>31</sup></code>, (that is, each integer fits in a <strong>32-bit</strong> signed integer type),</li>
	<li><code>f.length &gt;= 3</code>, and</li>
	<li><code>f[i] + f[i + 1] == f[i + 2]</code> for all <code>0 &lt;= i &lt; f.length - 2</code>.</li>
</ul>

<p>Note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number <code>0</code> itself.</p>

<p>Return any Fibonacci-like sequence split from <code>num</code>, or return <code>[]</code> if it cannot be done.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;1101111&quot;
<strong>Output:</strong> [11,0,11,11]
<strong>Explanation:</strong> The output [110, 1, 111] would also be accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;112358130&quot;
<strong>Output:</strong> []
<strong>Explanation:</strong> The task is impossible.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;0123&quot;
<strong>Output:</strong> []
<strong>Explanation:</strong> Leading zeroes are not allowed, so &quot;01&quot;, &quot;2&quot;, &quot;3&quot; is not valid.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num.length &lt;= 200</code></li>
	<li><code>num</code> contains only digits.</li>
</ul>

class Solution {
public:
    int n;
    bool found = false;
    vector<int> temp;
    string num;
    long long convertStringToNum(string& s, int from, int to)
    {
        long long ans = 0;
        for(int i = from; i<=to; i++)
            ans = ans*10 + (s[i] - '0');
        return ans;
    }

    bool fiboFound(int idx, int a, int b)
    {
        if(idx == n)
            return true;

        long long target = (long long)a + b;
        if(target > INT_MAX)
            return false;

        string comp = to_string(target);
        int i = idx;
        int j = 0;
        int l = comp.length();

        while(i < n && j < l)
        {
            if(num[i] == comp[j])
            {
                i++;
                j++;
            }
            else
                break;
        }
        if(j < l)
            return false;
        else
        {
            temp.push_back(target);
            if(fiboFound(i, b, target))
                return true;
            temp.pop_back();
            return false;
        }
    }

    vector<int> splitIntoFibonacci(string num) {
        n = num.length();
        this -> num = num;

        for(int i = 0; i<10 && i < n; i++)
        {
            long long first = convertStringToNum(num, 0, i);
            if(first <= INT_MAX && ((first != 0 && num[0] != '0') || (first == 0 && i == 0)))
            {
                int from = i+1;
                for(int j = from; j < from + 10 && j < n -1; j++)
                {
                    long long second = convertStringToNum(num, from, j);
                    if(second <= INT_MAX && ((second != 0 && num[from] != '0') || (second == 0 && j == from)))
                    {
                        temp.push_back(first);
                        temp.push_back(second);
                        if(fiboFound(j+1, first, second))
                            return temp;
                        temp.pop_back();
                        temp.pop_back();
                    }
                }
            }

        }

        return vector<int>();
    }
};
9800