/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 vote336 views1 answer
Python autocorrelation plot
Python
-1 vote333 views5 answers
Sudo apt install python3-pip
Python
0 vote365 views1 answer
Python http request params
Python
2 votes324 views2 answers
.encode python
Python
8 votes357 views1 answer
Use beautifulsoup
Python
18 votes360 views6 answers
2d list in python
Python
0 vote388 views1 answer
Flask return 404
Python Flask
16 votes360 views3 answers
How to find if a value is even or odd in python
Python
0 vote350 views1 answer
Check how many days old file is python
Python
0 vote361 views1 answer
Train test validation sklearn
Python