House Robber - Leetcode 198 - Dynamic Programming (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@wanzhaocheng8973]

love how you showed all three approaches in the code! really helped me understand the essence of DP solution

[@balaganesh3440]

That was the most simplest break down of this problem! Cant thank you enough!

[@Mamuuh]

This is the best explanation I’ve seen. So much clearer now, thank you!

[@calebghirmai6478]

Big thanks for taking the time to make this video! You broke down the concepts of DP in a helpful way :)

[@GregHogg]

Glad to hear it!

[@krishhhhh3677]

Great way to explain Dp🎉

[@christianjt7018]

Nice to see both the Top down and Bottom up solutions. I think bottom up solution is more intuitive in this case.

[@GregHogg]

I think so too :)

[@shaunakchaudhary2178]

One quick question. I got really confused on which value do we select exactly. How do we decide on which value to start with initially?

[@SHIHJUIheh]

So impressive! Thanks for providing multiple solutions for DP

[@GregHogg]

You're welcome 🙂🙂

[@Azyrys]

You're amazing at explaining things :D Big thanks for the content.

[@trh786fed]

By looking to all these comments it seems like im the only one who didn't understand

[@AdityaGupta-wz9di]

your explanation is soooo good damn you explained it in such an easy way thanks

[@mairahmed6196]

Man I was having such a hard time figuring this out Thank you so much for this video man

[@GregHogg]

You're very welcome!

[@denizmetzger7410]

... as always... impressive and absolutely well explained! 💪🏻👍🏻

[@GregHogg]

Awesome, very glad to hear it :)

[@insoucyant]

Thank You!

[@NikerB]

Great explantation, how long have you been coding?

[@GregHogg]

Thank you! Several years

[@rajendrabrahmbhatt2585]

Which software are you using to draw the solution ? Is this OneNote?

[@GregHogg]

Miro

[@xingyuxiang1637]

You can start from index 0, and for each associated element, select and unselect. If selected, move 2 steps. If unselected, move to the next step. In this way, you do not need to reverse or start from n - 1.

[@GregHogg]

We start from n-1 in the top down solution and start from 0 in the bottom up solution

[@nathanxie1194]

this was such a good explanaition but im still lost lmfao

[@lakh040]

same

[@shakilahmed4647]

Impressive Greg!

[@GregHogg]

Thank you!

[@codewithtm544]

I want to learn dsa in python so how can I start please guide me

[@GregHogg]

I have a full playlist of problem solutions

[@Fam-m4i]

Dude you made it complicated 😅. It’s an easy problem

[@yashpokar]

Line number 8-11 is unnecessary. Your explanation 🫡🫡🫡

[@AnnShi-c1v]

tysm omg

[@rajgarimella626]

Why can’t you just take the max of the sum of the even and odd indices?

[@mortsaidmort]

Because skipping two houses can be good, a la [10, 5, 5, 10] where 20 is the best score

[@jakewood1942]

Please tell me freshman computer science will be this interesting 😅

[@TuanNguyen-ed9rb]

yep, more interesting than this lol. Sometimes it's so interesting, you just want to smash your computer

[@kubs1162]

If you’re asking it probably wont

[@legobuildingsrewiew7538]

What about cases where the end of the array had something like 100 or another array where skipping two houses would be optimal? This algorithm doesnt seem to work here right?

[@christianjt7018]

yes, this algorithm still works, try it.