DP 1. Introduction to Dynamic Programming | Memoization | Tabulation | Space Optimization Techniques

preview_player
Показать описание


In this video, we have discussed what is memoization, what is tabulation, what is space optimisation with the classic Fibonacci problem. You might feel that this question has been done by you, but I will still urge you to watch this till the end because this is going to teach you a bunch of stuff.

Рекомендации по теме
Комментарии
Автор

The notes are added to the description :) Keeping the blackboard size as it is because I don't wanna stretch it and lose over quality. Cannot upload more than 1 video daily, because I have a full-time job, and it takes 3-4 hours per video, including editing and all.

takeUforward
Автор

Years ahead !!! Striver would be going into history as legend for all IT students!!!! 🙏🙏🙏🙏🙏🙏

utkarshyadav
Автор

My take from the video:
1. Recursion: each function calls give rise to 2 more: therefore O(2^n)
2. Memoization: stores in an array: O(n)
Subproblem results are stored in an array, ensuring that each subproblem is solved only once.
3. Tabulation: iterative approach and takes O(n) subproblems from the smallest to the largest.
RECURSION: Top down: We start from answer, go to the base case and then go back
MEMOIZATION: TOP DOWN: avoids redundant calls done in recursion reducing time complexity
TABULATION IS: Bottom up: We start from the base case and we try to go to the required answer

arunimaaa
Автор

DP is very fancy word even after having 10yrs of experience I wasn't sure what is DP, you explained it really well. Thanks.

Mohini-rtwu
Автор

Thank you for not forgetting us after joining google

yadneshkhode
Автор

@Striver I am wising I started following your content 2 years back, seriously its a goldmine . Thanks for all what you do for tech community for free.

ritikshandilya
Автор

I am not a master of recursion but i completely understood the whole lecture and enjoyed it!
This is my first dp video that I watched and I am totally comfortable with it
Thanks striver bro❤️

bibs
Автор

brother #Striver
Date 17/06/23
I start watching your video at night 2 Am and now it is 6:30 Am feeling very sleepy but the ( energy + enthusiasm ) you are showcasing in this video make me motivate to watch more 2 and 3 videos, Really nice content with great knowledge

AbhinavSingh-upbl
Автор

watched your videos during college placements 3 years back, now back here for another interview. Keep up the awesome work man !

ritikeshraj
Автор

Omg raj!!! The amount of energy with which you delivered is really appreciated even a person will wake up from sleep😂😂 and most of people including me has already solved this problem but I was unaware of tabulation and space optimization... I was that involved in the lecture ki pata nahi chala kab 30 mins hogaye. Thank you raj for this amazing series definitely going to follow this

harshitaSharmaE
Автор

I have finally started after procrastinating for such a long time and now i feel why didn't i started earlier, because after the very first lecture, i have got addicted to this.
And this energy our STRIVER god he is really the Virat Kohli of programming world.
And hell yeah UNDERSTOOD !!!
You are really an inspiration for me. LOVE and RESPECT

adarshanku
Автор

the videos of dp series are good, you will fall in love with the first video itself

sai-muhj
Автор

This guy is going to revolutionize the entire Indian coding community with his simple and clear explanations of very hard topics
thanks for the videos and notes and everything they are very helpful

spytonic
Автор

I am blown away with the quality of the content and especially the optimization of space complexity at the end ...Literally nobody started DP with this clarity and precision....More power to you striver <3 <3 <3 ....eagerly waiting for the next videos..

shivangisingh
Автор

love the energy you have put in the entire video. it motivates me to watch 2, 3 more lecture in one go.

ranveerkumar
Автор

Small Correction✅-> At 22:05 Fibonacci DP code is correct, but at the base condition i.e. if(n<=1) return n ----> it should be if(n<=1)) return dp[n] = n. As if this DP vector is used later for any purpose dp[0] and dp[1] will print out -1.
And thanks for this amazing playlist🔥.

anmolverma
Автор

I have started very late with DP Series but I am speechless after the video. Fibonacci looks like basic stuff for everyone but the way you have curated it using Memoization, Tabulation and Optimized (No extra space) deep rooted in my mind ("Understood"). Hats off brother!!! This gives me more energy and confidence to complete DP Series.

vamshipaidimarri
Автор

understood. I cannot believe such quality content is for free, you are amazing

Zomb-zjip
Автор

Not "just understood" but a different level of understanding. Hats Off

bhaswatiroy
Автор

I am learning first time "dp" and I understood whatever you taught . Thank you striver bhai ❤️

tusharnain