DP 5. Maximum Sum of Non-Adjacent Elements | House Robber | 1-D | DP on Subsequences

[@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.

[@aakashagarwal146]

Understood bro

[@dhrubajyoti3774]

Understood 🥺

[@tcob33yashambekar48]

Understood 👍👍

[@kunjparekh4632]

Understood

[@jasmeenkaur6001]

Understood😁

[@ankitadas5833]

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.

[@takeUforward]

Thanks 😊

[@YahyaMohammed-gh7np]

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.

[@ramyasri5452]

Today I had my Amazon interview and I got this exact questions and after completing the striver's dp series I was fully able to solve all the approaches and explain it to the interviewer so clearly and he was impressed by the way I explained the approaches and the time and space complexities! THANK YOU STRIVERRR!! You are the bestttt🎈

[@decepticonWave]

I love it when you get so excited and start speaking your native language. You are amazing striver

[@anoopsingh36]

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.

[@anuragprasad6116]

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!

[@dharssinikarthikeyan4760]

Thanks for this comment, I was confused and noticed only after you say!

[@user-nq7nt1rq9b]

This is my 1St comment on this channel Really he is explaining the thought process which should be come when we are solving problems

[@adarshanku7988]

Instead of adding base case as if(ind

[@shreyaagarwal6746]

I was struggling with this basecase and was missing to apply the max method considering the arr[0] too. Thanks for commenting this out.

[@Bhagsrocks]

Understood..You make learning fun :) I am done with my interviews but still don't want to miss learning any concept.This has never been me but all thanks to you :) You're indeed doing a great job!!!

[@deepakojha3216]

what an energy man....!!! ❤The way you teach make me fall in love with the programming .....!!

[@akashsardar495]

This is indeed the best DP series. Thanks for providing such quality content for free. I'm really enjoying it.

[@SHASHANKRUSTAGII]

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.

[@dineshchoudhary8635]

@@utkarshsharma6650 app bi

[@Bharat_Rider]

US

[@eklavya22k34]

So TRUE. Striver enjoys coding. Coding is Fun for many geeks.

[@shetty-m4d]

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❤

[@abhinavgupta5641]

The energy while teaching is just awesome man even a sleepy head can understand the concept u teaches, Hats off!❤

[@eshupatel3902]

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😇

[@chetanraghavv]

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!

[@057ahmaransari5]

what a content it's amazing . DP becomes easy for me till now because of you. Thank you so much.

[@TurboTalesShortsYT]

ur teaching method is just awesome....no one in the entire KZbin world has made such a best video on DSA. lots of love from my side.🤟🥰

[@abirhussain6033]

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.

[@aryangupta9062]

Striver has to be the craziest guy, came here to get through placements ended up wanting to code for fun!!! Understood concept very well!!

[@shreyajain5058]

"US"❤ the only channel which makes me understand all these problems so easily. Thankyou so much sir!!

[@KuldeepSingh-ru9ok]

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)

[@surabhsaxena7928]

Your enthusiasm and energy grabs my entire focus on the topic🔥🔥.. thank you for the series🙏🙏 "understood"

[@aprekshamathur6143]

thank u for this dp series. It's actually clearing my concepts.

[@rohangupta4290]

Man you are a genius when it comes to teaching!!

[@bhagyabeebaruah4900]

Falling in love with programming ❤️ all credit goes to you ..the way you teach is just🔥🔥

[@parthsalat]

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.

[@googlewasmyidea9895]

bruh, prev2 needs to be 0 because also if the negative check is omitted it'll work fine.

[@biswajitsaha6773]

Fully understood dada, your explanation is more than enough to write the actual code by ourselves!

[@khushisingh6651]

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 🥰🤩

[@TheAI-Tutor]

Kya haal hai khushi 😏

[@karthikeyansivakkumar5075]

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.

[@takeUforward]

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.

[@aakashagarwal146]

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

[@shaamidrees6036]

@@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

[@devankmaheshwari2712]

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

[@user-fb1yo8fb3i]

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.

[@beinghappy9223]

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

[@AbhishekSingh-hi5eq]

House robber problem on leetcode

[@gajjalaharsha]

Can we write base case for 1 if(n==1) return max(a[0], a[1])

[@lesGo.8963]

yes but that is only if the size of the vector is more than 1

[@prajaktagharal6258]

The way you teach..omg!! I just love it❤

[@karandeeplamba5027]

In this tabulation approach we consider max by picking a[i]+dp[i-2], now you may ask we can also take a[i]+dp[i-1], why? because lets say dp[i-1] is made by not picking a[i-1] so you can consider dp[i-1] but there is no need as it is redundant because if dp[i-1] is max sum till index i-1 without considering nums[i-1], it means it definitely picked a[i-2](as all are positive numbers)so dp[i-2] will be same as dp[i-1] in that case.

[@neshrochwani9934]

Understood perfectly, It has been so easy now to convert recursive code to Memoization, Tabulation and then space optimization approach Thanks A Lottt!!!!

[@aruna5869]

@25:18 Intro to space optimisation🔥😂❤.Thank you very much. Crystal clear explanation❤🙏

[@stith_pragya]

UNDERSTOOD............Thank You So Much for this wonderful video.........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@user-to3jj8lj8h]

"US" what the heck man, that space optimization is just superbb. thankyou so much striver.

[@varadpanchal1231]

BEST DP PLAYLIST EVER

[@birjeshgupta2003]

UnderStood , u are literally teaching in very nice manner.

[@bmishra98]

No need of if (i > 1), in space optimization. We can directly write like this, as prev2 is 0 anyways. int rob(vector& nums) { int n = nums.size(); int prev = nums[0]; int prev2 = 0; for(int index = 1; index < n; index++) { int rob = nums[index] + prev2; int notRob = 0 + prev; int curr = max(rob, notRob); prev2 = prev; prev = curr; } return prev; }

[@shriRadheHariom]

Great explanation Sir, You teach each and every concept with accuracy.Thanks a lot.

[@mendahaseena7901]

your way of solving DP problems really helpful for me. Thanks a lot

[@sudhanshuraj8080]

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!

[@amandubey9296]

Thank You Soo much Sir, I went for to much resourse to learn DP but your playlist is just awesome🙂. "US"

[@jerrry_coder6443]

In space optimisation approach there is no need to check the condition as the index can not be negative and we have create a variable that is prev2 for index = -1

[@karthikk2316]

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❤

[@UECAshutoshKumar]

Thank you sir 🙏 Understood!!

[@roshankarn7979]

love babbar bhaiya of channel code help explains space optimization sir. He also explains it very well.

[@codecrafts5263]

Understood. I watched this question on some other youtube channel but this one was far better.

[@idocoding2003]

Sir.... You are legend... Only one word to describe you

[@KaushalDhruw]

Your explanation is amazing, and your enthusiasm.. contagious. Can't thank you enough man.

[@thisisRandom-ut9iq]

I am a huge fan of yours. Please please do all data structures topic like Greedy,.....etc.

[@DuyPham-sq5qe]

The way he teaches is detailed and easy to understand. Thanks a lot!!!

[@bhupendramaurya6587]

Understood bhaiya with so much clarity, Thank you so much for providing content like this. Thank you again bhaiya

[@Abcd-jt1qs]

Understood sir! Thank you for these amazing lectures :)

[@raghavmanish24]

you are legend for dp playlist

[@HarishSG-z7b]

Hii all do not blindly follow, he is a great mentor. There is no doubt but 22:00 he explain tabulation method ,but neg variable is not used,a[index] will be contant at the for loop , output will be definitely wrong. This is the modified code. Pls check it. static int adjSumArray_Tabu(int n,int[] arr,int[] dp) { dp[0] = arr[0]; if(n>1) { dp[1] = Math.Max(arr[0], arr[1]); } for (int i= 2;i

[@ShreyaKarn-q2f]

"Understood". Another amazing lecture!!

[@LaxmiTeja-c2f]

Understood !! I know you are striver but for us you are a saviour..!

[@PrahladMehra-ou5bp]

best teacher ever

[@VivekSharma-eh2tv]

the space optimization is the so good , i feel so understood .

[@tsk1217]

Thankyou Bhaiya for this type of explaination , It helps me a Lot Lots ......... ❤ Understood

[@ashwaniagrawal27]

incredible explaination striver

[@AppaniMadhavi]

Understood and solved on my own, thank you striver for the amazing lectures!!!

[@neharathod637]

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!

[@harshkoshti4588]

Finally i understood how recursion is working in this program 😊

[@AyushGupta-ux4gq]

int rob(vector& nums) { int n=nums.size(); int prev2=0; int prev1=nums[0]; for(int i=1;i=2) { pick+=prev2; } int notpick=0+prev1; int curr=max(pick,notpick); prev2=prev1; prev1=curr; } return prev1; }

[@sujalgangrade7333]

Really Amazing explanation I am able to understand each and every concept very clearly 😇😇

[@imtiyazalam_IIItian]

thank you so much bhaiya for this amazing playlist

[@parthib.1555]

Understood !! btw I just wanna tell Dada and I are from the same college.

[@dewsara2888]

Thanks a lot. You are awesome. Understood very well.

[@animestuff144]

Understand veryyy well

[@anonymousboy2868]

us. Thank you so much for wonderful explanation

[@KapilMaan-vw9sd]

understood, very great video sir !!!

[@random_akki]

Thanks a lot bhaiya was able to solve it by my own

[@nikunjsoni123]

Understood: wonderful explanation! Thank you Sir!

[@anonymous5946]

i solved it basic (get the logic of pic and not pic just because i watch your recursion playlist) part own just missed one edge case and dp[ind-2] and get in first few min

[@Anonymous-th8sg]

sir watching now, and we support you for this wonderful content you are making for us. Much love sir❤

[@vasanthi_chitturi__]

Amazing Lecture!!!

[@NazeerBashaShaik]

Thanks for great explanation.

[@birvaoza6824]

Thanks for teaching this you are amazing

[@amankumarsingh4824]

Understood! Thank You Sir!

[@riturajghosh937]

Awesome explanation

[@harshal.petkar04]

Excellent.....Amazing.....fabulous.........

[@akbuddyeditors]

with due respect, Love babbar also teaches space optimization, but your explanation is better.

[@deepikabinjola2084]

understood completely😊 as your way of teaching is amazing !!👏

[@vanshthukral5477]

US. Thanks for making this amazing content!

[@sahilrepuriya3205]

Understood , now dp seems easy to me thank you so much sir 💙

[@babitakumari2172]

Solved it myself , thanku so much to make the dp concept easy

[@mathy642]

Hey Striver, The way you are explaining is really awesome and it is helping us to solve on our own :)

[@pardhi8959]

Salute for your hard work

[@yuvrajsingh-r8i]

Thank you bhaiya For Best Series

[@beilulbilly2636]

you really deserve a like

[@arpitmurailya]

us bhai. amazing lacture

[@user-bt6mh9ez3u]

Understood!!Amazing Videos

[@nitishaverma6557]

i was getting afraid from DP in vain , it seems to be quite easy and interesting to me !!

[@SOUVIK-po9jt]

@@nitishaverma6557 Which college do u study

[@abhijittripathy9486]

You are the Best man ❤‍🔥