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 vote112 views1 answer
How to convert cost to float in python
Python
1 vote117 views1 answer
Fastest sort python
Python
13 votes116 views3 answers
Python program to calculate factorial of a number.
Python
22 votes148 views6 answers
String palindrome in python
Python
0 vote128 views1 answer
Pandas row printed horizontally
Python
6 votes123 views2 answers
Count similar values in list python
Python
6 votes169 views1 answer
Axis number size matplotlib
Python
1 vote126 views1 answer
Discord music queue python
Python
0 vote123 views1 answer
Open image from link python
Python
23 votes119 views2 answers
How to check in which directory python in running
Python