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 vote152 views1 answer
Python sepia filter
Python
1 vote154 views1 answer
Django update increment
Python
-2 votes147 views1 answer
Numpy difference between two arrays
Python
0 vote156 views1 answer
Reset Python Dictionary to 0 Zero. Empty existing Python Dictionary
Python
0 vote112 views1 answer
Label encoding multiple columns
Python
0 vote155 views3 answers
How to count null values in pandas and return as percentage
Python
-1 vote144 views1 answer
Percent chart seaborn
Python
2 votes178 views1 answer
Python assign list item in for loop
Python
49 votes145 views6 answers
Plot using matplotlib
Python
0 vote150 views1 answer
How to install mediapipe python
Python