Available question text
Place the minimum number of cameras on nodes of a binary tree so every node is monitored by a camera on itself, its parent, or one of its children. This is a tree DP/greedy postorder problem that chooses local placements (camera/covered/uncovered) to minimize total cameras.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Diameter of Binary Tree
Coding · Binary Tree · Depth-First Search · DP on Trees
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 968. Binary Tree Cameras
Reported Aug 5, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
D. E. Shaw
Binary Tree Cameras
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 79.2. This is not an interview probability.
View source