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

2 votes148 views3 answers
Nested dictionary Python
Python
3 votes143 views1 answer
AttributeError: module 'librosa' has no attribute 'display' site:stackoverflow.com
Python
0 vote161 views1 answer
Theme_use() tkinter theme usage
Python
0 vote179 views1 answer
Streamlit change tab name
Python
17 votes193 views6 answers
Django model
Python Django
-1 vote148 views1 answer
How to make a ip tracker in python
Python
0 vote182 views1 answer
Extends template django
Python Django
2 votes148 views2 answers
Horizontal bar plot python
Python
0 vote137 views1 answer
Filter startswith django
Python
1 vote148 views1 answer
Python sum of list axes
Python