Memoization Technique in Dynamic Programming (DP)

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

[@GregHogg]

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

[@ItsGBMoD]

i love dp, im going to recommend it to my girlfriend

[@GregHogg]

That's a great idea, I bet she thinks about memoization a lot

[@scuderia6272]

💀

[@daviddong9916]

I watch you when I wake up and before bed. I watch you in gym and even in the bathroom. You already made me addicted to you ❤

[@GregHogg]

Hahaha. So sweet. Slightly creepy sounding, but mostly sweet haha

[@daviddong9916]

@@GregHogg I promise I will be less obsessed with you after I get multiple offers 😉

[@dionvarghese6489]

@@GregHogg looks like he wants to get dp’ed

[@scuderia6272]

Now I know why TikTok is getting banned lol

[@attenonmj3708]

Why?

[@scuderia6272]

​@attenonmj3708 bro updated the video, it had a tiktok video Snippet of a baddie

[@maitri1656]

Bro 😂 i thought it was fr
But thanks for this

[@GregHogg]

Hahaha yw

[@Joshjson]

DP more like Downbad Parasocial

[@ShardulPrabhu]

Use lrucache

[@littleapple5786]

❤

[@GregHogg]

[@ammarammar-to8jv]

can use some like this?
if n mod 2 =0
return n/2
else
( int n/2) +1

[@pedramghasemi1417]

How to master dp ?

[@sammohanty5507]

I am just starting with data structures and algo.
So cant understand the comments. This is a real solution for this problem ryt?

[@PostMeridianLyf]

fugging LOOOOOL

[@GregHogg]

Hehehe

[@robinjha7121]

if n==1:
return 1
prev=1
curr=2
for i in range(3, n+1):
temp=curr
curr=prev+temp
prev=temp
return curr

[@ohcrap2222]

A recursive solution but I think it's less efficient.

[@GregHogg]

Slightly, but time complexity it's still O(n)

[@shapelessed]

These are the kinds of worthless issues they task you with for a frontend sev position. Amazing, isn't it?