/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 vote295 views1 answer
Get file arg0 python
Python
0 vote309 views1 answer
In python, a list of characters is the same as a string.
Python
0 vote306 views1 answer
Change set item python
Python
0 vote347 views1 answer
Tkinter datatypes
Python
1 vote320 views1 answer
Run a loop in tkinter
Python
7 votes340 views1 answer
What is r strip function in python
Python
0 vote259 views1 answer
Replace all string in list python
Python
2 votes302 views1 answer
How to install dask in python
Python
0 vote342 views1 answer
Python flask how to remove last character from string
Python Flask
0 vote298 views1 answer
Enumerate items python
Python