/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 votes298 views1 answer
How to print single column in 2d array in python
Python
1 vote461 views3 answers
Ipynb to py online converter
Python
1 vote320 views1 answer
Django queryset first element
Python
0 vote344 views1 answer
Counting combinations python
Python
257 votes506 views23 answers
Drop column pandas
Python
0 vote361 views1 answer
Modulenotfounderror no module named 'config' python
Python
0 vote339 views1 answer
Heroku[web.1]: Process exited with status 3
Python
0 vote373 views3 answers
Flask models
Python Flask
0 vote412 views1 answer
How to write a script to display an image in python
Python
1 vote322 views2 answers
Python leetcode
Python