Classic Dynamic Programming Problem
Given: An array of positive integers, you can choose as many elements as possible and the sum of the numbers must be maximum. Note:-You cannot pick any two consecutive elements from the array.
Input: A sequence of positive integers. Output: Maximum sum.
The Solution uses a method which is discovered by myself while experimenting.