Problem Statement
Finding the maximum path sum in a triangle is a very common programming problem. You are given a triangle of numbers which can be represented as below. You are allowed to start from the top of the triangle and move to either of the two number below it. As we move down from the top to the bottom in multiple ways, we keep adding the numbers for each node we visit. The goal is to maximize the sum . A more formal problem statement can be found on the Project Euler website.
How to approach the problem
At any point you have two choices you can go to the number below the current ...

Read More
### Search TechieMe

### Subscribe to Blog via Email

Join 2,030 other subscribers