Grokking Oracle Coding Interview
0% completed
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content
.....
.....
.....
Like the course? Get enrolled and start learning!
S
Sreeraj Punnoli
· 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?
Show 1 reply
S
Sarah
· 3 years ago
These solutions all seem to fail on various cases when the code is run - is anyone else having issues?
Show 1 reply