human
Minimum Sum Path in a Triangle | Util function to find minimum sum for a path.
For storing the result in a 1 - D array , and simultaneously updating the result ..
For the bottom row.
Calculation of the remaining rows , in bottom up manner ..
return the top element.
Driver Code"
How can the above be solved in Python?

Give me a code to minimum Sum Path in a Triangle and the other steps required?
assistant
#Here is code to minimum Sum Path in a Triangle and the other steps required.
 def minSumPath ( A ) :
	memo = [ None ] * len ( A )
	n = len ( A ) - 1
	for i in range ( len ( A [ n ] ) ) :
		memo [ i ] = A [ n ] [ i ]
	for i in range ( len ( A ) - 2 , - 1 , - 1 ) :
		for j in range ( len ( A [ i ] ) ) :
			memo [ j ] = A [ i ] [ j ] + min ( memo [ j ] , memo [ j + 1 ] ) ;
	return memo [ 0 ]
A = [ [ 2 ] , [ 3 , 9 ] , [ 1 , 6 , 7 ] ]
print ( minSumPath ( A ) )