Question: (Dynamic Programming) You are required to find the greatest path sum starting at the top of the triangle and moving only to adjacent numbers on
(Dynamic Programming)
You are required to find the greatest path sum starting at the top of the triangle and moving only to adjacent numbers on the row below.
3 7 4 2 4 6 8 5 9 3
Write a python function on dynamic programming that returns the greatest path sum. In this it should be 23
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
