How Robbing Houses Can Make You Better At Dynamic Programming

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

[@vinitsunita]

Superb explanation 👏👏

[@HarshRaj-yj5gb]

Why can't we just take sum of two alternate endings. 1st - start from 1st house and take alternate house sum till end 2nd - do same but start from 2nd house Compare max of both at end and return?

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

[@iAmTheWagon]

Pretty cool explanation

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

[@XajiDahir]

Thank you.

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