David Jiang on Instagram: "One of the Hardest DP Question in Google Interviews . LeetCode 337, "House Robber III," is a dynamic programming problem that involves a binary tree representing houses. Each node in the tree represents a house, and the value at each node is the amount of money stored in that house. . Time Complexity = O(6^h), where 'h' is the height of the tree Space Complexity = O(h), where 'h' is the height of the tree . My name is David, and I am a software engineer at Meta. I’ve r