GitHub repository: AquisBlue/Maximum-sum-such-that-no-two-elements-are-adjacent
Created: 2019-09-05T09:24:34Z
Description: Given an array of positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7).Answer the question in most efficient way.