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 vote248 views1 answer
Get date only from datetimefiel django
Python
0 vote249 views1 answer
Powershell bulk rename and add extra string to filename
Python
0 vote260 views1 answer
Get timestamp with pyrhon
Python
3 votes260 views2 answers
Flask db migrate
Python
2 votes273 views6 answers
How to download nltk in python
Python
0 vote257 views1 answer
Python get all items exept las from array
Python
3 votes266 views3 answers
Python program to count vowels in a string
Python
3 votes220 views1 answer
Torch view
Python
0 vote245 views1 answer
Python make string one line
Python
0 vote264 views1 answer
Pandas string manipulation on column
Python