Binary Tree Cameras at DE Shaw
Hard47.6% acceptance
This problem has 100.0% frequency at DE Shaw.
Problem Description
You are given the `root` of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate children. Return _the minimum number of cameras needed to monitor all nodes of the tree_.
Read full problem and hintsTopics
Also asked at 14 companies
More DE Shaw Questions
Find Minimum Cost to Remove Array ElementsMediumMaximum Points After Collecting Coins From All NodesHardMaximum Strength of K Disjoint SubarraysHardFind the Sum of the Power of All SubsequencesHardGreatest Sum Divisible by ThreeMedium
View all DE Shaw questions