Use dynamic programming.
On Nov 4, 12:47 pm, Piyush <piyushra...@gmail.com> wrote:
> Given an array of integers. Imagine it as a pyramid as below:
> a[]={1,2,3,4,5,6,7,8,9,10}
> 1
> 2 3
> 4 5 6
> 7 8 9 10
> find a path from level 1 to last level such that the sum is maximum.
> The path is such that its children should be reachable.
> Eg:
> 1,2,5,9 is a path
> 1,2,6,10 is not a path since 6 is not reachable from 2.
> The array is not sorted and numbers are random.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
