human
Pascal 's Triangle | A O ( n ^ 2 ) time and O ( n ^ 2 ) extra space method for Pascal 's Triangle.
An auxiliary array to store generated pascal triangle values.
Iterate through every line and print integer ( s ) in it.
Every line has number of integers equal to line number.
First and last values in every row are 1.
Other values are sum of values just above and left of above.
Driver Code"
How can the above be solved in Python?

=====
Write me a code to pascal 's Triangle and the other steps required?
assistant
#Here is code to pascal 's Triangle and the other steps required.
 def printPascal ( n : int ) :
	arr = [ [ 0 for x in range ( n ) ] for y in range ( n ) ]
	for line in range ( 0 , n ) :
		for i in range ( 0 , line + 1 ) :
			if ( i == 0 or i == line ) :
				arr [ line ] [ i ] = 1
				print ( arr [ line ] [ i ] , end = " ▁ " )
			else :
				arr [ line ] [ i ] = ( arr [ line - 1 ] [ i - 1 ] + arr [ line - 1 ] [ i ] )
				print ( arr [ line ] [ i ] , end = " ▁ " )
		print ( " " , ▁ end ▁ = ▁ " " )
n = 5
printPascal ( n )