← Amazon questions

Maximum sum such that no two elements are adjacent

Filed under Amazon · Also reported at Accolite, GE, Groupon, Oracle, Salesforce

Given an array of positive and negative numbers, find the maximum sum possible such that no two selected 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.