How Robbing Houses Can Make You Better At Dynamic Programming

Leetcode 198. House Robber (bottom up)
Top down coming soon.. Dynamic Programming explanations Join the Discord to talk to me and the rest of the community!
/ discord

[@haseebasif100]

best video i came across on Dynamic programming after going through so many.

[@kantancoding]

Thank you for your comment! I have some more videos on dynamic programming in this playlist. Please let me know what you think 😊

[@PoojitTummalapalli]

i love the way you explained this

[@iAmTheWagon]

Pretty cool explanation

[@dhuxdheerdahir2736]

Thank you.

[@hawkingradiation3774]

great video, just wanted to know how did you created the leet template looked really good

[@dmitricherleto8234]

great explanation! may I ask what font are you using? It's so pretty

[@kantancoding]

Thanks! It’s called agave I believe

[@GauravDG1990]

I guess it should be dp[i] = max(dp[i-2] + nums[i], dp[i-1]) in for loop. Thanks for the explanation though!

[@kantancoding]

Hmm, I'm not sure what you mean. That's what it is in the video 😆

[@GauravDG1990]

Sorry my bad. 🙏🏻

[@iAmTheWagon]

How'd you type in 2 places at once when you made the method? What plugin is that?

[@kantancoding]

Google honza/vim-snippets 😉

[@buddhie1]

Hi Georgio aka Selikapro, are you open to having a mentee? 😊

[@kantancoding]

Hey bro. You don’t need a mentor. Just keep grinding 🙂

[@buddhie1]

@@kantancoding Sure will do 😊

[@reallylordofnothing]

I understood this. This version is better than neetcode one.
core of the solution is
maxWealth[i] = Math.max(maxWealth[i-1], (maxWealth[i-2] + houses[i]));

[@kantancoding]

I’m happy it helped!