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 vote269 views1 answer
Increase axis ticks pyplot
Python
0 vote251 views1 answer
How to call any function with it name as a string
Python
2 votes255 views1 answer
Replace space with _ in pandas
Python
2 votes279 views1 answer
Python print dictionary line by line
Python
30 votes287 views3 answers
Python newline character
Python
9 votes273 views2 answers
Python get copied text
Python
0 vote247 views1 answer
What data types store value by index in python
Python
1 vote257 views1 answer
Flask click submit button
Python Flask
0 vote251 views1 answer
Import matplotlib submodule 'style'
Python
12 votes288 views2 answers
New line eval python
Python