Practice House Robber III

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#337

LeetCode Problem

House Robber III

Dynamic Programming Tree Depth-First Search Binary Tree

Problem Statement

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called root. Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will automatically contact the police if two directly-linked houses were broken into on the same night. Given the root of the binary tree, return the maximum amount of money the thief can rob without alerting the police.

Source: House Robber III on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

root = [3,2,3,null,3,null,1]

Output

# Example 2

Input

root = [3,4,5,1,3,null,1]

Output

Constraints

The number of nodes in the tree is in the range [1, 10^4].

0 <= Node.val <= 10^4

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free