← Amazon questions

Maximum sum with no adjacent elements (House Robber)

Filed under Amazon

Given an array of non-negative integers, find the maximum sum of a subsequence such that no two elements are adjacent.

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.