Given a string of digits num, split it into a sequence of integers ans that satisfies the following conditions:

• The length of ans is at least $3$.

• ans[i] $+$ ans[i + 1] $=$ ans[i + 2] for all $0 \le i <$ ans.length $- 2$.

• Each element in ans fits within a signed $32$ bit integer, meaning $0 \le$ ans[i] $\le 2^{31} - 1$.

• No element contains leading zeros, except for the value $0$ itself.

• Concatenating the elements of ans in order reproduces the original string num.

Return any valid sequence ans. If no such sequence can be formed, return an empty list.

Constraints:

• $1 \le$ num.length $\le 200$

• num contains only digits.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.