/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

1 vote404 views1 answer
Hide particular attribute in django admin
Python Django
0 vote352 views2 answers
Leer fichero linea por linea python
Python
1 vote321 views1 answer
How to distribute a dataset in train and test using scikit
Python
0 vote318 views1 answer
Pyspark rdd sort by value descending
Python
0 vote340 views1 answer
How to print a groupby object
Python
0 vote422 views1 answer
Django month name from month number
Python Django
2 votes338 views2 answers
How to print right angle triangle in python
Python
1 vote380 views1 answer
Why men are better than woman
Python
1 vote387 views1 answer
How to check the django version on a mac
Python Django
0 vote393 views1 answer
NameError Traceback (most recent call last) <ipython-input-36-28457fcc3f62> in <module> ----> 1 plt.bar(freqs.index, freqs.values, color = "green") 2 plt.show() NameError: name 'freqs' i
Python