House Robber III (Tree DP with Choice Constraint)

Problem Overview

Given a tree where each node has an integer value, for each node you may choose EITHER the current node's value OR the values of its children nodes — but not both (i.e., if you select a node, you cannot select its parent or its direct children). Return the maximum…

• 2 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people