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

1 vote107 views2 answers
If condition in print statement python
Python
0 vote108 views1 answer
Python load a txt file and assign a variable
Python
2 votes108 views1 answer
Variable in regex python
Python
6 votes87 views2 answers
Import discord
Python
0 vote113 views1 answer
ImportError: cannot import name 'get_column_letter' openpyxl
Python
4 votes177 views2 answers
Authentication views django
Python Django
0 vote131 views1 answer
Web socket in python
Python
1 vote159 views1 answer
Django manager
Python Django
2 votes116 views2 answers
Python curses for windows
Python
0 vote106 views1 answer
Python int in list
Python