/Python/The grandest staircase of them all foobar solution

The grandest staircase of them all foobar solution

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

2 votes235 views2 answers
Np convert to int
Python
0 vote282 views1 answer
Python tuple multiply sequence
Python
0 vote189 views1 answer
How to restart a loop
Python
9 votes218 views3 answers
A value is trying to be set on a copy of a slice from a DataFrame.
Python
0 vote190 views1 answer
How to decode recv data in python
Python
0 vote202 views1 answer
Gematria python
Python
1 vote196 views1 answer
How to make a alert box in python
Python
0 vote198 views1 answer
Play Audio File In Background Python
Python
0 vote200 views1 answer
Python Tkinter timer animation
Python
3 votes253 views3 answers
Virtualenv -p python3
Python