/Python/The grandest staircase of them all foobar solution

The grandest staircase of them all foobar solution

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 vote203 views1 answer
Python kdtree import
Python
1 vote202 views1 answer
How to make a blank window open up in python
Python
4 votes147 views4 answers
Python hex
Python
0 vote161 views2 answers
Headers cors
Python
0 vote168 views1 answer
Effient way to find prime no inpython
Python
0 vote151 views1 answer
How to access dataframe row by datetime index
Python
0 vote189 views1 answer
Pathlib is symbolic link
Python
15 votes295 views6 answers
Flask install
Python Flask
1 vote156 views3 answers
Rgb to grayscale python
Python
0 vote156 views2 answers
Iris data pandas scatterplot
Python