House Robber | LeetCode 198 | Google Coding Interview Tutorial

House Robber solution: LeetCode 198
Code and written explanation: terriblewhiteboard.com/house-...
Link to problem: leetcode.com/problems/house-r...
Buy Me a Coffee: www.buymeacoffee.com/terrible...
AFFILIATE LINKS
If you're interested in learning algorithms, these are great resources.
💻 40% off Tech Interview Pro: techinterviewpro.com/terriblew...
⌨️ 20% off CoderPro: coderpro.com/terriblewhiteboard
💲 All coupons and discounts 💲
terriblewhiteboard.com/coupon...
House Robber | LeetCode 198 | Google Coding Interview
#houserobber #leetcode #algorithms #terriblewhiteboard #codinginterview
Click the time stamp to jump to different parts of the video.
00:00 Title
00:07 Problem readout
01:03 Whiteboard solution
04:09 Coding solution
09:21 Result and outro

[@TerribleWhiteboard]

If there are any videos you'd like me to make or if you have any ideas on how to optimize this solution, let me know!

[@drishyapremchandani6438]

please make all variations of buying and selling stocks please !!

[@275phuongvy]

can you make the video for Sort List ? #148 with the "BOTTOM UP MERGE SORT" solution? There are videos explaining this question. However, no one explain the bottom up merge sort with O(1) space complexity.

[@thesuperiorman8342]

You are very gifted at teaching. I can't thank you enough.

[@TerribleWhiteboard]

Thanks!

[@hyrdeshgangwar]

Brilliant! Whiteboard solution part was enough for me to get the logic. Thanks !

[@TerribleWhiteboard]

Awesome!

[@rohitjaiswal4121]

You explain very nicely. Please make a tutorial series on Dynamic Programming! Thanks for your efforts! :-)

[@TerribleWhiteboard]

Thanks!

[@colesiegel1922]

Your videos are great. Just a suggestion, it would be great to add Big O analysis and optimisations (e.g. don't need to store full dp array, can reduce space complexity from O(n) to O(1) by storing 2 variables instead.)

[@leetann5341]

Love the way you explain things. Keep it up you are doing a great job and hope your channel grows.

[@TerribleWhiteboard]

Thank you!

[@jwastken8814]

I watched a bunch of videos on this problem and studied the discussion section on leet code. I was very confused until just now. You're a great teacher man. Thank you for your help.

[@whatstwelveohnine]

thank you so much

[@TerribleWhiteboard]

You're welcome!

[@rakshitnaidu5985]

Great Explanation! Can't thank you enough for this!!

[@TerribleWhiteboard]

Thanks! Glad to help!

[@souravmanjhi7238]

that was a wonderful explaination
totally got the logic

[@TerribleWhiteboard]

Thanks!

[@tkhalifeh]

great job !

[@TerribleWhiteboard]

Thanks!

[@adityatrivediii]

Nicely explained ! Thanks

[@TerribleWhiteboard]

You're welcome!

[@bvhdv]

This is the best explanation for this problem on CZcams. Thanks.

[@shriramravishankar8800]

very clear explanation, thank you!

[@TerribleWhiteboard]

Thanks!

[@szujanlin9820]

very well explained. Thanks for spending time for making this video

[@TerribleWhiteboard]

Thanks!

[@albertszymanski7177]

Excellent explanation. I spent nearly 2 hours trying to find an ultimate solution for every case but I gave up... Thanks to your explanation now I completely have a grasp of that problem. You're a brilliant teacher

[@TerribleWhiteboard]

Thanks!

[@dammanhhieu]

Very interesting 👍

[@TerribleWhiteboard]

Thanks!

[@sylascoker1483]

You are the best man!!! I struggled so hard to understand but you've made it so cleart for me, thank you so much!! I implemented what you explained into my own code and it worked first time !!!

[@TerribleWhiteboard]

Thanks! Glad to hear it!

[@namanvohra8262]

The best explanation so far, thank you for making this video!

[@markzuckerbread1865]

very intuitive solution that helps a lot with other dp problems, thank you!

[@TerribleWhiteboard]

You're welcome!

[@duane1015]

Is this the optimal solution? Space complexity could be reduced by only memo-izing the last max values (instead of memo-izing all of them)

[@sunnilabeouf]

You're right, my space complexity shot up to 90% since now it's O(1) space. Here's my code:
var rob = function(nums) {
if(!nums || nums.length === 0) return 0;
if(nums.length === 1) return nums[0]
let prevMax = nums[0], currMax = Math.max(nums[0], nums[1]), tempMax
for(let i = 2; i < nums.length; i++){
tempMax = Math.max(prevMax + nums[i], currMax)
prevMax = currMax
currMax = tempMax
}
return currMax
};

[@bolarinwaowuogba3268]

Thank you for explaining things so well

[@TerribleWhiteboard]

You're welcome!

[@275phuongvy]

great explanation. Thank you

[@TerribleWhiteboard]

Thanks!

[@vivekgagrani8288]

Very good explanation sir

[@antutucat8231]

thanks

[@cupofjava5480]

didn't pay much attention and thought you coded in java :)) , anyways very good teaching , I finally understood this 1d dp

[@SoReaICru]

What app are you using to draw on these videos? It's like a whiteboard!

[@TerribleWhiteboard]

It’s just the standard Notes app on the iPad.

[@krishna81m]

@@TerribleWhiteboard What hardware is that? So, you just connect your IPad and write on screen? How was Mac able to split the drawing from IPad input and typing from Keyboard input at the same time?

[@TerribleWhiteboard]

I use the Apple Pencil to draw and a separate bluetooth external keyboard to type. They're both connected at the same time.

[@ridhwaans]

wouldnt you get an out of bounds exception at the last number in the array loop?

[@pranjalsingh1287]

Your voice feels like you are sad or cryring 😅

[@TerribleWhiteboard]

The saddest.

[@jwastken8814]

id have to disagree with this comment. its pretty chill.

[@allan1827]

gg

[@TerribleWhiteboard]

Thanks!