-
-
Notifications
You must be signed in to change notification settings - Fork 7.6k
Implemented LeetCode Problem #337 - House Robber III in C++ using Tree DP #3034
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@darshkantaria
darshkantaria
requested review from
Panquesito7 and
realstealthninja
as code owners
October 10, 2025 04:51
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds a C++ solution for LeetCode Problem #337 - House Robber III
Approach: Dynamic Programming (Tree DP) using Post-order DFS
Each node computes two states:
Time Complexity: O(n), where n = number of nodes
Space Complexity: O(h), where h = height of the tree
The code includes detailed inline comments and explanation of the approach,
making it easy to understand and reusable for similar tree DP problems.
Optional test case is included but commented out for safe submission.