Top Down vs Bottom Up Dynamic Programming!

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[Joshjson]

Last time we got explained memoization at the uni, it was abysmal. Love your stuff!

[livelaughlove_h]

This guy is concise, clear and fast. Perfect.

[amir]

When I was in algo class, I never understood the difference. I thought everything was just tabulation. Thanks so much for the video man.

[Flybot]

Greg, your videos are awesome. Can you please do tutorials on dynamic programming. It will be really helpful for a beginners like me. Thanks in advance.

[jeffreybuffkin]

You can use a generating function for Fibonacci’s series. Almost all recursions can. Why not just solve it, then no dynamic programming is necessary?

[kumarashutosh-pn]

if possible then do solve combinations leetcode

[mrt_]

this is already a stupid way to do fibonachi.
def fib(a: int b: int, count: int) -> int:
if count <= 0: return a
return fib(b, a+b, count - 1)
there you now have an O(n) solution.

[ytlongbeach]

i don't know about you, but i always prefer the sideways approach.

[cz_alpha]

Would top down DP typically include recursion? I’m not saying that as a rule but rather as maybe a best practice in certain scenarios like the one presented here btw

[garya]

I'm not trying to nitpick, just understand as I'm just starting. Isn't memoization a specific technique to retain the solved problem and top down a strategy for DP? If there are no overlapping sub problems then I'd still be doing topdown but have no memoization right? TIA.

[kiranreigns]

I wonder why he wears that hat all the time?🤔

[yaroslavpanych]

Would you stop giving terms to every elementary thingy? That sounds so ridiculous that i even don't want hear about it