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 vote166 views1 answer
Python mongodump
Python
0 vote220 views1 answer
Dict itterator python recursive
Python
1 vote196 views1 answer
How do you create a countdown using turtle python
Python
1 vote166 views1 answer
Get number of key in dictionary python
Python
0 vote163 views1 answer
Ensure string length 2 python
Python
1 vote165 views1 answer
Coronavirus program in python
Python
0 vote170 views1 answer
Collecting candies codevita solution in python
Python
0 vote185 views1 answer
Django project files
Python
5 votes111 views1 answer
Get hour in python
Python
0 vote207 views1 answer
Matplotlib pyplot comment on plot
Python