Is it possible to find maximum sum of two numbers in an unsorted array such that the numbers are not adjacent to each other in O(N)?
Given an array, all of whose elements are positive numbers, what is the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array?