Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 306. Additive Number
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source