House Robber 2 (LeetCode 213) | Full solution with easy explanation | Diagrams | Study Algorithms

[@samyukta4369]

My god, the way you just simplified this problem is amazing. Thank you!

[@rishichansauria3658]

I have no words to thank you. I have been watching coding videos for a long.. but I have never watched such an explanation. You are the best teacher.

[@PreetiYadav-np5pg]

Do you know you are an awesome teacher?
I mean just the way you break problems and get a solution, I just love the way you explain.

[@nikoo28]

Thank you so much…your words are so motivating :)

[@KittyInCali]

Never could I imagine that I would not be afraid of dynamic programming, all because of your teaching style, please keep continuing and teaching us more

[@YorozuyaNeesan2010]

My favorite explanation so far. Thank you for sharing this and drawing out the logic. Much appreciated.

[@pavanipunyamanthula1059]

Ur the best among all..❤

[@kunalsarpal7564]

Sir you are genious .

[@qR7pK9sJ2t]

Master-piece..
Hats-off to you for also adding visual graphics..
No - one would want to take any extra pain for adding visual graphics..
I think your aim is to deliver the best quality videos and explanation..
Magical !!!!!!

[@nikoo28]

I try to add graphics to make things easier to remember. :)

[@curiousmanash8154]

Best teacher love you sir❤

[@Ranjan-xc5nl]

Elegant explanation, perhaps best I have seen so far.

[@sureshkannan6313]

Now a days, if i want a solution, first searching your video for the problem first on TH-cam. Thank you for sharing your knowledge here.🙃🙃

[@nikoo28]

Glad to hear that

[@thesoftwareengineer17]

you really know how to teach . great work.✅

[@ayushpatel4475]

Absolutely Wonderful Explanation sir 👏👏👏👏👏

[@allroundgyaan2786]

Awesome explanation

[@atanukundu_10]

You are a legend, thank you for making these videos.

[@sjaisri]

instead of skipfirst or skiplast, we can choose max(house[first],house[last] ) and follow the same code for houserobber1

[@010101dddm]

excellent explanation

[@nikoo28]

Try house robber 3 as well…you are gonna love dynamic programming 😄

[@buihoa3553]

Thanks for your great video! It helps me a lot.

[@amitdahal9053]

Thanks bro! This video was super useful. Watched few others but none come close to you

[@nikoo28]

Glad to hear it!

[@rogerthat7190]

Thank you!

[@safar19899]

Excellent explanation!

[@candichiu7850]

Super clear and great as aways!

[@ivandrofly]

Interesting - thanks

[@syedaafreen1075]

Amazing 🎉

[@divineATheaven]

Thanks!!

[@subee128]

Thanks

[@shraddhajain8935]

Great explanation but wont this increase space complexity with 2 arrays?

[@nikoo28]

O(2n) is equivalent to O(n)

[@ssquare1]

acha bataye ho bhai

[@GoNguyen-i3k]

Brother you are handsome and talent, thank you brother 😊

[@nikoo28]

So nice of you

[@satvrii]

Hey i have one doubt. What if the max loot we get by skipping the first house is not including last index either. Means we get the max loot in the first case through second last index. In such case, it would always be good to add first house since we are no way adding last index but we can't since our array doesn't contain it. How is that case considered

[@nikoo28]

We consider both the cases…either we pick the first house…or we leave the first house.
The maximum of those is the max loot.

[@satvrii]

@@nikoo28 thanks ❤

[@learningcuriously1940]

@@nikoo28 let's say we get the maximum by leaving the first house, then in that case, how can we add last house as it is not in our array ?

[@BEAST-ry8bk]

@@learningcuriously1940 thats why we made another auxillary array for that

[@GoNguyen-i3k]

Brother why new int[num.length -1] i don't understand why you set -1 and the last is private int nums, what the input i should add in that, what is int[] nums mean, omg its hard to understand brother

[@nikoo28]

which part are you facing a problem with?

[@MdAzharuddin-h3u]

what about only two houses then answer must be zero nh coz they are adjacent to each other.

[@nikoo28]

But you can still rob one of them