Given a tree with `n` nodes labeled from `0` to `n - 1` and an array of restricted nodes, find the maximum number of reachable nodes from the root node (0) without visiting any restricted node.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.