this question cooked me, i ended up doing combinatorics (finding the number of ways to arrange 1’s and 2’s at each possible combination of 1 and 2) before i realized it was just fibonacci
Attended one interview, always I get problems I never come across or didn't study or cover it. One interview asked my leetcode Id, and then changed sample questions on the topics I didn't cover.
Master Data Structures & Algorithms For FREE at AlgoMap.io!
this question cooked me, i ended up doing combinatorics (finding the number of ways to arrange 1’s and 2’s at each possible combination of 1 and 2) before i realized it was just fibonacci
I took my algorithms class last semester and this is so good. Algorithms is the best part of CS in my opinion. Great video
Really glad to hear it!
This is the best tutorial that I saw, first time I clearly understand how different approach worked. (And how to convert between them)
Thank you for this alternate approaches and explaining each line out. Really helps my understanding!!
tysm. You're better than neetcode for sure.
Yeah, Neetcode presents a very confusing video for this problem!
First video that helped my understand this intuitively. Thanks Greg! Kudos ❤
Greg thank you so much, I couldn't find understanding dp so easily anywhere else
Glad to hear it 🙂
Please complete this DSA playlist first. VERY HELPFUL
First before what?
Great explanation, what app are you using for drawing ? thankss a lot !
Miro :)
This is so good! I'm just starting to learn about DP and it's not as intimidating as reddit made it seem 😂😂
Can you use the Binet formula? I know it is just approximate but at least it takes O(logn) time complexity
Yes you can
Attended one interview, always I get problems I never come across or didn't study or cover it. One interview asked my leetcode Id, and then changed sample questions on the topics I didn't cover.
Wow that's actually insane
Yo what the f
I probably will not keep hitting the same hardware parts. I will not worry too much about operations research, either. I will use clear_cache().
what