House Robber III (Tree DP with Choice Constraint)

CodingZipLast reported February 2026Medium Frequency
Reported
6× across candidate reports
First seen
March 2025
Last reported
February 2026
Also asked in
Phone Screen
Reported outcome
mixed

Problem Overview

The round is one tree problem, then a forest of trees, asked on the first-round technical screen and at the onsite. Six reports. Candidates call it House Robber III (LeetCode 337); one report says the binary tree became a general tree. Outcomes are mixed: two posters passed, one was rejected…

  • 3 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
Unlock the full Zip catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Zip question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?