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 vote300 views1 answer
Display array of odd rows and even columns in numpy
Python
0 vote320 views1 answer
Re python split()
Python
0 vote306 views2 answers
How to delete a row based on a criteria in python datafram
Python
0 vote289 views2 answers
Pandas fast way to view distribution by group
Python
0 vote334 views1 answer
How to install packages offline? Ask Question
Python
0 vote309 views1 answer
Question command python
Python
2 votes294 views1 answer
Python for doing os command execution
Python
6 votes356 views3 answers
Cosine Similarity numpy
Python
0 vote355 views1 answer
Start a django project
Python Django
0 vote281 views1 answer
Youtube upload python
Python