Dude your explanation is so simple. You need to teach algorithmic problems and how to dissect them. Amazing Job!!
@Gsudi
5 ай бұрын
Why can't I make this video fullscreen? Strange.
@mahadevovnl
7 ай бұрын
3 Months later: "Ya you need to center that div please."
@iamtheboneofmysword728
2 ай бұрын
Isn't this the fibuonacci sequence
@iamtheboneofmysword728
2 ай бұрын
Oh nvm you said it at the end of the video
@chinwubachukwudi4483
Жыл бұрын
thank you
@AlgoJS
Жыл бұрын
No problem, thanks for watching!
@bencebukovecz8665
Жыл бұрын
Aka Fibonacci sequence
@Prod3t
Жыл бұрын
goat. but how did you come up with the algorithm are you just a math wizard?
@AlgoJS
Жыл бұрын
Start off with recursion so top down approach, then convert to bottom up 👍
@ryanmamboudjemtchemeu4289
Жыл бұрын
Thank you. Very simple explanation.
@AlgoJS
Жыл бұрын
You're welcome Ryan
@WhyAreThereHandlesNow87
Жыл бұрын
Is there a formula to skip the iterations?
@doriancheval2831
Жыл бұрын
Yes, look at the Fibonacci sequence
@WhyAreThereHandlesNow87
Жыл бұрын
@@doriancheval2831 Thank you for this >.> Binet's Formula, it seems. Includes math way above my head but it is cool to know its out there
@ko-Daegu
Жыл бұрын
@@doriancheval2831 how is it related don't get it
@rayleighslivers2187
Жыл бұрын
its super weird that you started indexing at 1
@AlgoJS
Жыл бұрын
dp[1] in regards to ways to get to the 1st step dp[2] in regards to ways to get to the 2nd step All indices will be matching the step we are currently on. Hope this helps!
@denizoz9224
Жыл бұрын
Yeah, it makes sense for code clarity. That poor empty dp[0] register tho 😅
Пікірлер: 21