Grandest staircase foobar

def solution(n):
    m = [[0 for i in range(n + 1)] for j in range(n + 1)]
    m[0][0] = 1  # base case
    for stair in range(1, n + 1):
	    for left in range(0, n + 1):
	        m[stair][left] = m[stair - 1][left]
	        if left >= stair:
	            m[stair][left] += m[stair - 1][left - stair]
	          	
    return m[n][n] -1

Source: livecodestream.dev

Similar codes

0 vote221 views1 answer
Python pandas first and last element of column
Python
0 vote209 views1 answer
Cv2 warpaffine rotate
Python
1 vote222 views1 answer
Sample based on column pandas
Python
0 vote234 views1 answer
Comma separator f string python
Python
1 vote201 views1 answer
Python convert string to sentence case
Python
2 votes200 views1 answer
Print all keys having same value
Python
1 vote225 views1 answer
Verificar se arquivo existe python
Python
35 votes219 views2 answers
Download pyaudio for python 3.9
Python
-1 vote225 views2 answers
Grid off matplotlib
Python
0 vote225 views1 answer
Textrank python implementation
Python