DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences
Vložit
- čas přidán 9. 07. 2024
- Lecture Notes/C++/Java Codes: takeuforward.org/data-structu...
Problem Link: bit.ly/3q5rlUY
Make sure to join our telegram group for discussions: linktr.ee/takeUforward
Pre-req for this Series: • Re 1. Introduction to ...
Full Playlist: • Striver's Dynamic Prog...
In this video, we have discussed how to solve the problem of the maximum sum without taking adjacent elements. Here the concept of pick non pick has been explained.
If you have not yet checked our SDE sheet, you should definitely do it: takeuforward.org/interviews/s...
You can also get in touch with me at my social handles: linktr.ee/takeUforward
I need your support, and you can do that by giving me a like, and commenting "understood" if I was able to explain you.
Understood bro
Understood 🥺
Understood 👍👍
Understood
Understood😁
Understood Sir. At 3:50 min of the video I paused it and went to the recurrence playlist, then watch lecture no 6 & 7 thoroughly and then came here .Amazing session .Thank You Sir for helping us to improve our skills.
Thanks 😊
Believe me I have been trying to solve dp problems since 6 years and never came across this playlist. Amazing learning technique. This will surely help me in cracking interviews.
I never had a habit of commenting. But the way you are teaching makes me enthusiatic towards dsa understood each and every concept following from array to dp was a long journey. It wasnt possible without .once again thank u bhai❤
An absolute living legend! Your content is truly remarkable and deserving of endless likes and a multitude of subscribers. Keep up the incredible work.
legend is like bhagat singh , freedom frighters .
Striver is a very hardworking guy.
I got confused when you wrote f(ind) at 7:57. Immediately, the pop up rectified the mistake. It's amazing how much work has gone in these videos! I'm loving the playlist till now! Keep up the good work man. Your inputs to the community are huge and they will definitely return back to you in one way or another. Best wishes!
Thanks for this comment, I was confused and noticed only after you say!
I love it when you get so excited and start speaking your native language.
You are amazing striver
You explained so well, dp was to be hard topic for me but after watching your videos the thought just reversed. Keep going. Most hardworking man i ever seen.
The way he teaches is detailed and easy to understand. Thanks a lot!!!
This is indeed the best DP series. Thanks for providing such quality content for free. I'm really enjoying it.
what an energy man....!!! ❤The way you teach make me fall in love with the programming .....!!
Understood!! Thank you for all the efforts in putting up such an amazing playlist!
Really sparks my interest in DP, knowing the thought process behind solving every problem.
Keep up the good work!
Thanks you striver for such an amazing tutorial. Your recursion playlist and now this DP series is building an amazing confidence inside me .Now I feel that I can solve the DP problems easily.
The energy while teaching is just awesome man even a sleepy head can understand the concept u teaches, Hats off!❤
This is my 1St comment on this channel
Really he is explaining the thought process which should be come when we are solving problems
Man you are a genius when it comes to teaching!!
us. understood in one go ! and DP never seemed so easy before this video . keep up the good work.
thank u for this dp series. It's actually clearing my concepts.
Hats off to this guy whenever we discuss about dp, people just start with tabular method no one teaches how to apprach that, what is the intution behind that approach but this guy making the concepts crystal clear. Thank you so much bhaiya😇
Initially I was not able to understand anything related to DSA. I thought that I am not for this. But when i started seeing your videos I found that what I was lacking was a good teacher who is able to understand such advance complex concept in matter of minutes in the best simple way possible. I would have never imagined myself solving hard level dsa questions without you. Thank you sir for all your efforts . Please continue teaching. We will be always with you. THank YoU.
ur teaching method is just awesome....no one in the entire CZcams world has made such a best video on DSA. lots of love from my side.🤟🥰
Your enthusiasm and energy grabs my entire focus on the topic🔥🔥.. thank you for the series🙏🙏
"understood"
I can find the recurrence relation of a problem and determine whether it is a dynamic programming problem by determining if there is any overlapping sub-problem. The interesting fact is that I have learned these from this playlist. Thanks a lot, bro.
This is just the 4th lecture, I struggle a little bit while writing recursive solution, but memoising it, and then tabulating it, and then space optimizing it has become so easier, i never thought dp would be fun. Thank you sir!
BEST DP PLAYLIST EVER
Best playlist ever of dp....and you have proved it✌️
This is the best dp series of all time. Thank you striver for all the efforts you put in this.
Understood !!
I know you are striver but for us you are a saviour..!
Words are not enough to describe this perfect explanation, keep going please.
I think we can write one more base case for index = 1. Like 0, when 1 is reached then it means element at 2 wasn't selected and we want to maximize sum so we can select either nums[0] or nums[1] so return max(nums[0], nums[1]) as we need to maximize sum. By doing so we can omit the line that is returning 0 when n < 0
Thanks Striver, Wonderful explanation!
Instead of adding base case as if(ind
I was struggling with this basecase and was missing to apply the max method considering the arr[0] too. Thanks for commenting this out.
Your explanation is amazing, and your enthusiasm.. contagious. Can't thank you enough man.
your efforts are priceless thanks for making such content, you are a true educator.
Striver has to be the craziest guy, came here to get through placements ended up wanting to code for fun!!! Understood concept very well!!
bhaiya you are the best i mean i was confused with dp for so long time and this was becoming the only topic which I was afraid to cover but now my concepts are getting clear and thankyou so much for this series at this time since this will help me do goood in my internships thankyou bhaiya 🥰🤩
Kya haal hai khushi 😏
Understood and very much liked you teaching technic. I admit you as a role model.🔥🔥🔥
Awesome sir
UNDERSTOOD............Thank You So Much for this wonderful video.........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
The way you explain na, aisa lagta hai ki you yourself enjoy this, and that is why your basics are so clear. Keep it up. Google ka CEO banoge ek din.
@@utkarshsharma6650 app bi
US
So TRUE. Striver enjoys coding. Coding is Fun for many geeks.
Falling in love with programming ❤️ all credit goes to you ..the way you teach is just🔥🔥
Hey Striver,
The way you are explaining is really awesome and it is helping us to solve on our own :)
UnderStood , u are literally teaching in very nice manner.
it was literally the best series . i am myself to able to code recursion problems now and its boosting my confidenece and also bhaiya the space optimisation part is just awesome yar
Its good to watch good content for free.. I just finished recursion playlist and now watching DP. For me it is a hard topic, tabulation technique is most difficult but i hope i will get it by the end of this playlist. (NON-CS BACKGROUND)
I have watched your 4 DP lectures
and trust me
I was able to solve this question in in one go.
even pehli bar DP touch kiya , from today itself
This is your contri !
US!!!
Fully understood dada, your explanation is more than enough to write the actual code by ourselves!
In space optimizations, it's better to initialise things like this:
int pre1 = nums[0];
int pre2 = nums[0];
int curr;
Just because this makes more sense.
bruh, prev2 needs to be 0 because also if the negative check is omitted it'll work fine.
Understood buddy. As usual, great explanation. Get well soon too. Just a request. Need a little more clarity on how to identify whether to approach as a greedy algo or dynamic programming pattern just by looking at a problem.
Generically if u see greedy failing, switch to trying all cases by recursion. For this u need your brain to generate test cases and figure this out that greedy is failing.
As much as I can think if the data is sorted and have uniform difference between them then I think we can go with greedy else dp
Correct me if I am wrong plz
@@aakashagarwal146 not uniform but some sort of increasing difference
In coin change problem greedy works for 1,2,5,10,20.... becz difference is 1,3,5,10 which is in order and not overlapping
but in cases where difference is overlapping or not in any order like when coins are 2,3,6,7.
here greedy fails becz the difference is 1,3,1 which is overlapping
hope you got the idea
Sir.... You are legend... Only one word to describe you
Understood sir, Your content is really of very good quality and make us how we can analyze the problem and think of approach. Really appreciable.... Thankyou sir
Bhaiya Codestudio platform is lagging many a times , could u please provide problem links of similar type that are available on gfg , leetcode , codeforces, codechef etc for practice
House robber problem on leetcode
Can we write base case for 1 if(n==1) return max(a[0], a[1])
yes but that is only if the size of the vector is more than 1
Understood bhaiya with so much clarity, Thank you so much for providing content like this. Thank you again bhaiya
hands down the besttt ever video i have ever seen i solved this robber problem using kind of pattern but why i never understood how did it work ...but i always wanted to know how it works internally....but i have to say now that i hate that kind pattern orinted dp problem instead i love this memo and space idea.....Hats off!!!striver bhai❤
Amazing Explanation Striver!! Understood all the concepts taught in the video.
Understood .Quality teaching bro.Thank u so much.
Understood !!! Amazing Lecture 👌
Understood and solved on my own, thank you striver for the amazing lectures!!!
Wow man!! Understood everything
sir watching now, and we support you for this wonderful content you are making for us. Much love sir❤
Understood !!!!! Thankyou so much Striver
Understood. I watched this question on some other youtube channel but this one was far better.
Thanks for these kind of videos. It is helping a lot.
understood completely😊 as your way of teaching is amazing !!👏
Thankyou so much Striver😊
Understood , now dp seems easy to me thank you so much sir 💙
Thanks for providing such quality content for free. "understood".
Solved it myself , thanku so much to make the dp concept easy
Great explanation Sir, You teach each and every concept with accuracy.Thanks a lot.
amazing explaination what a style of teaching
Thanks!! I am finally understanding DP :D
you are legend for dp playlist
Understood!!Amazing Videos
Understood: wonderful explanation! Thank you Sir!
Understood, awesome explanation.
"Understood". Another amazing lecture!!
understood ,Awesome explanation❤❤❤
I found the best DP playlist ever, free or paid. understood sir
Understood the whole concept. Awesome video sir.
@25:18 Intro to space optimisation🔥😂❤.Thank you very much. Crystal clear explanation❤🙏
Finally i understood how recursion is working in this program 😊
Thank you sir 🙏
Understood!!
thanks a ton for your efforts! ❤
Salute for your hard work
@striver your efforts are really amazing!
Thanks for this amazing content 😍
Thanks for great explanation.
Loved it !!
the space optimization is the so good , i feel so understood .
Understood beautifully!!!!! ❤🔥❤🔥❤🔥❤🔥❤🔥
Understood sir! Thank you for these amazing lectures :)
hats off to your efforts
great as always
Amazing Lecture!!!!
Really Amazing explanation I am able to understand each and every concept very clearly 😇😇
Amazing explanations, keep going please.
"US" .... absolutely the best teacher ❤
Amazing content. Thanks alot
understood sir, great job
This question made me realize that striver's series are really building my logic as I solved this problem using technique i learned in Backtracking playlist.
Understood Striver great effort from your side
understood sir...great explaination.