Solution: Additive Number
Explore how to solve the additive number problem by implementing backtracking in Go. This lesson teaches you to partition digits into additive sequences by testing all valid combinations while respecting constraints such as no leading zeros. You will gain skills to recursively validate numeric sequences and optimize the process by pruning invalid paths, helping you apply these techniques to similar combinatorial interview questions.
We'll cover the following...
Statement
An additive number is a string whose digits can be partitioned into an additive sequence.
A valid additive sequence contains at least three numbers, where every number after the first two is equal to the sum of the two immediately preceding numbers.
Given a string, num, containing only digits, determine whether it represents an additive number. Return TRUE if a valid additive sequence can be formed from the digits of num, and FALSE otherwise.
Note: Numbers in the additive sequence cannot have leading zeros. For example, the sequences
1, 2, 03and1, 02, 3are both invalid.
Constraints:
num.length...