Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.