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 vote352 views1 answer
Python function guts
Python
0 vote335 views1 answer
Python int in list
Python
12 votes348 views3 answers
Python pandas read_csv tsv
Python
0 vote302 views1 answer
Hh:mm to mins in python
Python
-2 votes332 views1 answer
How to make discord.py rewrite bot dm someone
Python
0 vote349 views1 answer
Bar chart with x-ticks
Python
5 votes307 views1 answer
Torch concat matrix
Python
19 votes314 views6 answers
Python dictionary to list
Python
0 vote308 views1 answer
Add user agent selenium python canary
Python
0 vote366 views2 answers
Data frame list value change to string
Python