/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

0 vote145 views1 answer
Make image to string to use in tkinter
Python
12 votes153 views5 answers
Python keyboard press
Python
62 votes152 views6 answers
Time in python
Python
0 vote140 views1 answer
Introduction python graphviz simple graph examples
Python
0 vote305 views1 answer
Python devops modules
Python
7 votes149 views3 answers
How to update list in python
Python
3 votes140 views2 answers
Python set terminal size
Python
2 votes145 views2 answers
Export pythonpath linux
Python
31 votes138 views5 answers
How to loop through files in a directory python
Python
0 vote140 views1 answer
Django email change sender name
Python