/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

8 votes150 views6 answers
Calculator in python
Python
0 vote144 views1 answer
Avoir l'indice d'un nombre dans un array numpy
Python
0 vote146 views1 answer
Split df coliumn
Python
0 vote138 views2 answers
Pandas apply check for string length in column
Python
0 vote138 views2 answers
Python convert long floats to usd
Python
0 vote143 views1 answer
Transverse tensor in pytorch
Python
3 votes131 views1 answer
Delete a key value pair from a dictionary in python
Python
0 vote147 views1 answer
Isntall packages to databricks
Python
0 vote135 views1 answer
Pyqt5 qpushbutton disable
Python
5 votes140 views2 answers
Python ffmpeg
Python