Maximum Sum of Non-Adjacent Elements
Given an array of integers, select two elements at non-adjacent indices such that their sum is maximized. Return the maximum possible sum.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late March, 2026
Meta
Senior
Given an array, choose 2 nonadjacent indices so that the sum of the value of those indices are maximized
Hello Interview Premium
Your account is free and you can post anonymously if you choose.