Code: Select all
2
6 3
6 5 9
1 2 9 3
Paths run top to bottom and only progress through 'neighboring' values (2->6->9->9 would be impossible, for example).
Find the value of the maximum path for the pyramid given in the text file attached below.
For further explanation, see this video: https://youtu.be/T-SLD0x8XrU
You may ask clarification questions on this thread or have related discussion, but DO NOT POST THE SOLUTION / CODE.
The solution is given in this video: https://youtu.be/0yUNpWfioQg