Скачать или смотреть Master dynamic programming with Maximum path sum in a Triangle : Fully explained

Matrix math problems seem complex because of the hype surrounding the word matrix, however, once you solve a few of them you will start loving them and the complexity will vanish.
Solving the matrix problems using the dynamic programming technique will make your journey very enjoyable because solving them will appear as a magic to you.

Joey'sTech will do everything to remove fear and complexity regarding matrix math problems from your mind and that is why I keep adding problems like ' Maximum path sum in a Triangle'
to my dynamic programming tutorial series. So watch this video till then end and you will have another problem in your pocket.

Problem statement

You are given integers in the form of a triangle. The pictorial representation of the triangle is here

3
4 2
5 1 6 7
1 2 5 8 9



All you need to do is to find out the path from the top to the bottom of the triangle that gives you the maximum sum. You need to solve it using dynamic programming technique.

There is always a condition in such DP problems. In this problem, the condition is that you can move down to adjacent numbers only.
Like, in the above problem, if you start from 3 then you can move to either 4 or 2.

From 4, you can move to 5 or 1 but you can't move to 6 from 4 because it is not adjacent to it.
Similarly from 1, in the third row, you can move to either 2 or 5 but you can't move to 1 in the fourth row (because it is not adjacent).

I am sure you have got the problem now, let's move to solving it now in this video of Joey'sTech.

-------------------Also Watch--------------------

1. How to find minimum cost path in a matrix
   • How to find minimum cost path in a matrix ...  

2. Find all possible paths between two points in a matrix
   • Find all possible paths between two points...  

3. Learn to solve matrix chain multiplication using dynamic programming
   • Learn to solve matrix chain multiplication...