/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

31 votes157 views1 answer
Sort_values pandas series
Python
0 vote278 views1 answer
Django retrieveupdatedestroyapiview
Python
0 vote190 views1 answer
Torch.utils.data.random_split(dataset, lengths)
Python
1 vote194 views2 answers
How to add watermark in mp4 video using python
Python
1 vote225 views3 answers
Pdf to csv
Python
1 vote202 views1 answer
Object.image.url email template django
Python
1 vote265 views1 answer
Listing index elasticsearch python
Python
5 votes159 views2 answers
Change space to underscore python
Python
1 vote203 views1 answer
Turn of axis
Python
23 votes461 views3 answers
Pip install django rest framework
Python Django