← Amazon questions

Max sum without adjacents

Filed under Amazon · Also reported at Yahoo

Given an array of positive integers, find the maximum sum of a subsequence with no adjacent elements (House Robber problem).

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.