Split Array into Fibonacci Sequence

Given a string num representing a non-negative integer, split it into a Fibonacci sequence, a sequence of numbers such that:

The first two numbers in the sequence are at least two digits long. The rest of the numbers in the sequence are one or more digits long. The sequence should start with the first two numbers in the string, which can be any two or more digits. The remaining numbers in the sequence must be the sum of the preceding two numbers. Return a list of the Fibonacci sequence if it exists, and an empty list if it does not.