/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

4 votes180 views2 answers
Python number to array of digits
Python
0 vote167 views1 answer
Pycairo
Python
40 votes158 views6 answers
How to print error in try except python
Python
0 vote217 views3 answers
Python ascii to string
Python
0 vote178 views1 answer
Assert raises with properties python
Python
0 vote175 views1 answer
Who is agada nathan
Python
0 vote183 views1 answer
Recorrer lista desde el final python
Python
8 votes174 views2 answers
Python foreach 2d array
Python
5 votes217 views1 answer
Pip3 install pyaml
Python
1 vote163 views1 answer
Python 3 tkinter treeview example
Python