Dynamic Programming - Top Down Memoization & Bottom Up Tabulation - DSA Course in Python Lecture 15

[@GregHogg]

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

[@ahmedzz4754]

I really appreciate your help , you helped me pass the ecpc(egypt's collegiate programming contest) qualification today

[@GregHogg]

Really glad to hear it, and huge congrats!

[@creativeusername4400]

grateful for your consistency!

[@helloworldcsofficial]

Great explanation. Thank you!

[@bigk9000]

Wouldn't the Golden Ratio approach be O(1) time since it isn't iterating through anything?

[@adityakhambeteIIT]

raising something to power of n is O(logn) since it uses binary search at the backend

[@kumaranb8702]

Good 😊

[@GarouNguyen]

Bro thank for your value bring to the world, but videos about recursion and backtracking I still don't understand ☹️😣😣 can you explain about backtracking in second video for a video just 2 minutes

[@Ganesh-lm5dx]

yes same here i could not understand backtracking implementation

[@user-jm6gp2qc8x]

this is actually good lol

[@DrDeuteron]

What do you think of this:
def fib(n, _m={0:0, 1:1}):
try:
y = _m[n]
except KeyError:
y = fib(n-1) + fib(n-2)
_m[n] = y
finally:
return y

[@AKProductionsTelugu]

What were you thinking by writing an ugly syntax here 😂

[@harish-zp8hz]

why do we use self.fib instead of fib

[@jorgetomaylla5032]

fib is a function of the Solution class in leetcode, you can tell when the function has a "self" as an argument. The self basically allows for a distinction of this fib function in comparison to another Solution object's fib function. So, you must call self.fib() to indicate that you wish to call this class's fib function. It will also throw an error saying "fib()" not recognized if you do not use self. It's a good safety measure too

[@harish-zp8hz]

@@jorgetomaylla5032 tnxx

[@bahulyank.t7590]

Hi