### Array Triangle Path From Top to Bottom

##### Find the minimum path sum from top to bottom, each step you can only move adjacent indices of below row.

For example:

[ [2], [3,4], [6,5,7], [4,1,8,3] ]

Latest Source Code:

Github: ArrayTrianglePath.java

**Output:**

Triangle: [[2], [3, 4], [6, 5, 7], [4, 1, 8, 3]] Minimum Path: 11