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 vote152 views3 answers
Insertion sort calculator
Python
0 vote186 views1 answer
Django model specify table name
Python Django
5 votes146 views1 answer
Python close input timeout
Python
1 vote248 views1 answer
Media pipe install ERROR: Could not find a version that satisfies the requirement mediapipe (from versions: none)
Python
2 votes150 views3 answers
Python count of values in array
Python
0 vote154 views3 answers
Seaborn heatmap x labels horizontal
Python
0 vote192 views2 answers
Instagram comment spammer python
Python
-1 vote158 views1 answer
Cannot import name 'SGD' from 'keras.optimizers'
Python
1 vote161 views2 answers
How to make a game in python
Python
1 vote163 views1 answer
Debconf: falling back to frontend: Readline Configuring tzdata
Python