Leetcode 306. Additive Number

Determine whether a digit string can be partitioned into at least three numbers (no leading zeros) that form an additive sequence where each number equals the sum of the previous two; solved by trying possible first-two splits and verifying subsequent sums (may require big-integer handling).