Algorithm to find the maximum subsequence of an array of positive numbers . Catch : No adjacent elements allowed

Question

For example, given

A = [1,51,3,1,100,199,3], maxSum = 51 + 1 + 199 = 251.

clearly max(oddIndexSum,evenIndexSum) does not

Answer 1

max(oddIndexSum,evenIndexSum) does not work

For the example you gave, it does - however, if you have something like: A = [1, 51, 3, 2, 41, 23, 20], you can have 51 + 2 + 23 = 76, or you can have 51 + 41 + 20 = 112, which is clearly larger, and avoids adjacent elements as well. Is this what you're looking for?