<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>


MAX = 2 << 31 - 1


def get_num(val):
    val_int = int(val)
    if (val[0] == "0" and len(val) > 1) or val_int > MAX:
        return None

    return val_int


class Solution:
    def solve(self, solution, rem):
        b, c = solution[0:2]

        a = c - b
        if c > (MAX):
            return []
        search_a = str(a)
        # print(c, b, search_a, rem)
        if rem == 0:
            return solution  # found

        if self.num[:rem].endswith(search_a):
            return self.solve([a] + solution, rem - len(search_a))
        else:
            return []

    def splitIntoFibonacci(self, num: str) -> List[int]:
        self.num = num

        end = len(num)
        for i in range(end - 1, max(end - 11, -1), -1):
            c = get_num(self.num[i:end])
            if c is None:
                continue
            for j in range(i - 1, max(i - 11, -1), -1):
                b = get_num(self.num[j:i])
                if b is None:
                    continue
                for k in range(j - 1, max(j - 11, -1), -1):
                    a = get_num(self.num[k:j])
                    if a is not None and c == a + b:
                        solution = self.solve(solution=[a, b, c], rem=k)
                        if solution:
                            return solution

        return []
16500