Minimum Sum Path

Calculate minimum sum path

arr = [
0     [2],
1    [3,4],
2   [6,5,7],
3  [4,1,8,3]
]

[ 11, 10, 10 3 ] => i = 0, j = 0
[ 9, 10, 10, 3 ] => i = 1, j = 0, 1
[ 7, 6, 10, 3 ] => i = 2, j = 0, 1, 2
[ 4, 1, 8, 3 ]

[ 9 ]
[ 6, 6 ]
[ 1, 1, 3 ]
[ 6, 5, 7 ]