House Robber - Leetcode 198 - Dynamic Programming (Python)

Please check my playlists for free DSA problem solutions:

My Favorite Courses:

Data Structures & Algorithms:

Python:

Web Dev / Full Stack:

Cloud Development:

Game Development:

SQL & Data Science:

Machine Learning & AI:

[GregHogg]

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

[wanzhaocheng]

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

[philipthomas]

Thanks a million, I couldn’t understand Neetcodes explanation but this made it so clear

[anjuraghuwanshi]

I can't thank you enough for the way you explain DSA! Your teaching is a blessing—so clear, patient, and engaging. Learning from you feels effortless, and I genuinely appreciate the time and effort you put into these videos. You’re making a huge difference in so many lives! Sending lots of gratitude and respect your way. ❤🙏✨

[calebghirmai]

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

[balaganesh]

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!

[davidwankenobi]

I don't know if it was just because this was the third video I watched or if the explanation was just better, but for some reason after watching this, it just clicked. Thanks for making this!

[Cherep]

Way better explanation than on other channels

[piyushbhuva]

dude you are always concise and too the point... I love it

[Azyrys]

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

[AdityaGupta-wzdi]

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

[shaunakchaudhary]

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?

[christianjt]

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

[trhfed]

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

[SHIHJUIheh]

So impressive! Thanks for providing multiple solutions for DP

[mairahmed]

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

[hyrax_attack]

I found I didn't fully understand the algorithm even though could code the solution when I thought about hops of more than 1 house. Like in case 1, 0, 0, 10 for example.
Demonic Programming is tricky.

[denizmetzger]

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

[xingyuxiang]

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.