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

15 votes114 views2 answers
How to play audio
Python
0 vote103 views1 answer
Round list of floats python
Python
6 votes120 views9 answers
E
Python
0 vote97 views1 answer
Python to c++ compiler
Python
2 votes94 views1 answer
Matplotlib insert text
Python
0 vote155 views1 answer
Face sentiment
Python
2 votes90 views2 answers
How to store object in file python
Python
0 vote127 views1 answer
How to downgrade python 3.9 to 3.8
Python
2 votes120 views1 answer
How to redirect in flask to the same page
Python
0 vote92 views1 answer
Resizing django embed player
Python