Grokking Dynamic Programming Patterns for Coding Interviews
Vote

0% completed

​

Solution: Staircase

.....

.....

.....

Like the course? Get enrolled and start learning!
A

Anonymous

· 4 years ago

These solutions all seem to fail on various cases when the code is run - is anyone else having issues?

Show 1 reply
A

Anonymous

· 4 years ago

For n == 0, "base case, we don't need to take any step, so there is only one way". Why is it like that? If n is 0, there is no stairs and no way. Why is the result 1 for n ==0?

Reading Progress

0%

Vote for new content