Leetcode 70. Climbing Stairs [Java] | Two best approaches

Check out how to solve the leetcode 70 Climbing Stairs question in Java. This is one of GOOGLE's most commonly asked coding interview questions according to Leetcode. In this video, you will see two possible solutions which both are faster than 100% of the leetcode submissions.
Question URL: leetcode.com/problems/climbin...
Please write in the comments below which leetcode problem you want me to solve next.
And remember, a leetcode a day keeps unemployment away!
Thanks for watching!
#leetcode70

[@raj_kundalia]

thank you!

[@ifelsestatement7803]

You are always welcome! Thanks for the comment!

[@maksymr.7191]

Thank you, bro. It's very helpful now.

[@ifelsestatement7803]

Glad it helped you! You are welcome!

[@sarankarthicg5208]

Thank you so much mate!

[@ifelsestatement7803]

You are welcome! Thanks for your comment!

[@user-fj3zh8cv7p]

Thank you for this video! I am still learning about time complexity and I was wondering how your solutions differ from what I came up with =>
const steps = (n) => {
if(n === 0 || n === 1) return 1;
return stairs(n-2) + stairs(n-1);
}

[@clickrad]

Fibonacci

[@poojamadhu2201]

thanks

[@asmaasadek7735]

Thanks alot that was pretty clear.

[@ifelsestatement7803]

Thanks a lot for your feedback!

[@molihey]

thanks a lot! Amazing

[@ifelsestatement7803]

You are welcome! Thanks for your comment!

[@nikstatus0735]

thnks really easy code to understand

[@ifelsestatement7803]

Thanks for watching!

[@yugeshm8224]

Thanks man

[@ifelsestatement7803]

You are welcome, man!

[@cinemafellaz]

why do we need to specify the n==1 case?
if (n

[@vicente3j]

The way he codes it it would throw a runtime time error since right after dp[1] = 1 you say dp[2] = 2. Index 2 is outside of the bounds of the array (size is 2, last index is 1)

[@Steklopod]

Нихрена не объяснил. Чисто заготовку напечатал

[@ifelsestatement7803]

Ну не знаю, вроде все должно быть понятно