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

76 votes203 views6 answers
Python iterate through list
Python
0 vote221 views1 answer
Python arabic web scraping
Python
21 votes189 views5 answers
Format string to 2 decimal places python
Python
91 votes176 views6 answers
Reverse array python
Python
2 votes164 views3 answers
.first() in django
Python
0 vote172 views1 answer
Python program that gives the user a positive integer N, prints the number in the N position of the Fibonacci sequence
Python
0 vote129 views1 answer
A chef has a large container full of olive oil. In one night, after he used 252525 quarts of olive oil, 35.9\%35.9%35, point, 9, percent of the full container of olive oil remained. How many quarts of olive oil remained in the container?
Python
1 vote197 views1 answer
E: Unable to locate package python3-pip docker file
Python
11 votes179 views5 answers
Python Ordered Dictionary
Python
5 votes169 views2 answers
Pandas convert index to column
Python