← Amazon questions

Maximum Non-Adjacent Subsequence

Filed under Amazon

Given an array of integers, find the maximum sum of a subsequence such that no two adjacent elements are selected (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.