Maximum Path Sum I#

tri = """
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23
"""

myarr = [list(x.split()) for x in tri.strip().split('\n')]

possible_paths = []
max_len = len(myarr)
def path_func(st, i, j, length):

    st.append(myarr[i][j])

    if (length == max_len):
        possible_paths.append([int(x) for x in st])

    # left recurse
    if (i+1 < max_len):
        path_func(st, i+1, j, length + 1)

    # right recurse
    if (i+1 < max_len and j < len(myarr[i+1])):
        path_func(st, i+1, j+1, length + 1)

    st.pop()

path_func([], 0, 0, 1)

max(list(map(lambda x: sum(x), possible_paths)))

OUTPUT

1074