<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 {
private:
    bool solve(long long int start,long long int n,string num,vector<int>&ans,vector<int>&finall,long long int first,long long int second)
    {
        if(start==n)
        {
            finall=ans;
            return true;
        }
        long long int third=0;
        for(long long int i=start;i<n;i++)
        {
            if(i>start && num[start]=='0')
            {
                break;
            }
            
            third=third*10+(num[i]-'0');
            if(third>INT_MAX)
            {
                break;
            }
            if(first+second==third)
            {
                ans.push_back(third);
                bool temp=solve(i+1,n,num,ans,finall,second,third);
                if(temp){
                    return true;
                }
                ans.pop_back();
            }
        }
        return false;
    }
public:
    vector<int> splitIntoFibonacci(string num) {
        vector<int>ans;
        vector<int>finall;
        long long int n=num.length();
        long long int first=0;
        for(long long int i=0;i<n-2;i++)
        {
            if(i>0 && num[0]=='0')
            {
                break;
            }
            
            first=first*10+(num[i]-'0');
            if(first>INT_MAX)
            {
                break;
            }
            ans.push_back(first);
            long long int second=0;
            for(long long int j=i+1;j<n-1;j++)
            {
                if(j>i+1 && num[i+1]=='0')
                {
                    break;
                }
                second=second*10+(num[j]-'0');
                if(second>INT_MAX)
                {
                    break;
                }
                ans.push_back(second);
                bool temp=solve(j+1,n,num,ans,finall,first,second);
                if(temp)
                {
                    return finall;
                }
                ans.pop_back();
            }
            ans.pop_back();
        }
        return finall;
    }
};
9200