← Amazon questions
CodingReported in a candidate post, Jul 2025

Maximum sum of non-adjacent elements

Filed under Amazon

Given an integer array `nums`, find the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the original array. An empty subsequence has a sum of 0. If all…

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.