/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

-1 vote311 views1 answer
Map numpy array
Python
6 votes320 views4 answers
How to ask a question in python
Python
0 vote275 views1 answer
String to list in python comma
Python
0 vote318 views1 answer
Fast input python
Python
1 vote367 views2 answers
One hot encoding numpy
Python
1 vote300 views1 answer
How to input 2-d array in python
Python
1 vote270 views1 answer
How to fix geometry of a window in tkinter
Python
4 votes294 views1 answer
Python format only 1 decimal place
Python
1 vote297 views1 answer
How to open an external file in python
Python
0 vote283 views1 answer
Master python
Python