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

1 vote334 views1 answer
Torch tensor equal to
Python
2 votes328 views4 answers
How to add column to np array
Python
5 votes315 views2 answers
How to check if text is lower in python
Python
20 votes334 views4 answers
Python time execution
Python
0 vote309 views2 answers
Count items in a model django rest
Python
0 vote316 views1 answer
Remove stopwords from list of strings python
Python
0 vote355 views1 answer
Pandas convert string to numpy array
Python
-1 vote331 views1 answer
Python remove \t
Python
2 votes323 views2 answers
How to get key of a particular value in dictionary python using index
Python
15 votes338 views3 answers
Sum of 2 numbers in python
Python