House Robber 3 (LeetCode 337) | Full solution with diagrams | Dynamic Programming | Study Algorithms

This robber is very crazy, and this time they want to rob houses that are arranged in form of a binary tree. The condition remains same though, no two adjacent houses can be robbed. In this solution we derive a solution step by step, to determine what could be the maximum loot using dynamic programming. All along with beautiful animations and a dry-run of code in JAVA.

Actual problem on LeetCode: https://leetcode.com/problems/house-r...

Chapters:
00:00 - Intro
01:11 - Problem Statement and Description
03:41 - How to attack such problems
10:50 - Deriving a solution
12:53 - Dry-run of Code
16:11 - Final Thoughts

📚 Links to topics I talk about in the video:
House Robber 1:    • House Robber (LeetCode 198) | Full so...  
House Robber 2:    • House Robber 2 (LeetCode 213) | Full ...  
Dynamic Programming:    • Dynamic Programming easy to understan...  

📘 A text based explanation is available at: https://studyalgorithms.com

Code on Github: https://github.com/nikoo28/java-solut...
Test-cases on Github: https://github.com/nikoo28/java-solut...

📖 Reference Books:
Starting Learn to Code: https://amzn.to/36pU0JO
Favorite book to understand algorithms: https://amzn.to/39w3YLS
Favorite book for data structures: https://amzn.to/3oAVBTk
Get started for interview preparation: https://amzn.to/39ysbkJ

🔗 To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalg...

🎥 My Recording Gear:
Recording Light: https://amzn.to/3pAqh8O
Microphone: https://amzn.to/2MCX7qU
Recording Camera: https://amzn.to/3alg9Ky
Tablet to sketch and draw: https://amzn.to/3pM6Bi4
Surface Pen: https://amzn.to/3pv6tTs
Laptop to edit videos: https://amzn.to/2LYpMqn


💻 Get Social 💻
Follow on Facebook at:   / studyalgos  
Follow on Twitter at:   / studyalgorithms  
Follow on Tumblr at:   / studyalgos  
Subscribe to RSS feeds: https://studyalgorithms.com/feed/
Join fan mail: http://eepurl.com/g9Dadv

#leetcode #programming #interview