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 vote204 views1 answer
Select default option django form
Python
0 vote211 views1 answer
Take the first in dataloader pytorch
Python
1 vote224 views1 answer
ValueError: There may be at most 1 Subject headers in a message
Python
69 votes218 views3 answers
Reverse the words in a string python
Python
-1 vote215 views2 answers
HeapSort
Python
0 vote222 views1 answer
Export a Pandas dataframe as a table image
Python
1 vote209 views1 answer
Python unicode is not defined
Python
1 vote190 views3 answers
Inheritance in python 3 example
Python
13 votes224 views1 answer
Python clear the printed text
Python
0 vote198 views1 answer
Putting in text in python
Python