/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 vote238 views1 answer
Flask put request example
Python Flask
53 votes175 views6 answers
Python 2 decimal places format
Python
35 votes173 views6 answers
Create pandas dataframe from dictionary
Python
3 votes163 views1 answer
Get range of items of python list
Python
0 vote175 views1 answer
Root = tk() python 3
Python
0 vote249 views1 answer
Python regular expression escape vertical bar |
Python
0 vote174 views1 answer
Extract only year from date python
Python
10 votes180 views3 answers
Logarithmic regression python
Python
2 votes189 views1 answer
Python find max in list of dict by value
Python
4 votes188 views3 answers
Update python ubuntu
Python