/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

4 votes242 views1 answer
Python find most occuring element
Python
5 votes269 views4 answers
Ipython play sound
Python
0 vote266 views1 answer
Drop row pandas column value not a number
Python
0 vote287 views1 answer
How to install python packages in local directory
Python
0 vote285 views1 answer
Theta hat symbol python code
Python
4 votes279 views2 answers
Change django admin title
Python
1 vote249 views1 answer
Get body from request python
Python
13 votes265 views6 answers
Adding roles discord py
Python
1 vote271 views1 answer
Split string and convert to int python
Python
0 vote218 views1 answer
Django trim string whitespace
Python