โ† Amazon questions

Fibonacci-like String Partitioning

Filed under Amazon

Given a string of digits, partition it into a sequence of numbers such that each number after the first two is the sum of the two preceding numbers. Return true if such partition exists, else false.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.