Grandest staircase foobar

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 vote223 views1 answer
Pandas df where row has na
Python
7 votes144 views6 answers
Python hello world
Python
1 vote125 views1 answer
Replace url with text python
Python
6 votes126 views2 answers
Python print version python
Python
0 vote109 views1 answer
Python win32api setcursorpos
Python
0 vote132 views1 answer
Run all python files in a directory in windows
Python
4 votes134 views1 answer
Remove multiple space python
Python
3 votes144 views5 answers
Swap in python
Python
3 votes206 views1 answer
Import "decouple" could not be resolved Pylance
Python
0 vote171 views1 answer
Flash not defined python flask
Python Flask