You are given a graph represented as an adjacency list, where each key is a node and its corresponding value is a list of neighboring nodes. Given a specific node, find the maximum number of nodes that can receive a message sent from this node, considering that each node can only relay the message once.
Analyze constraints and compute optimal solutions step-by-step.
No dry run loaded.
🚀 Practice this problem
Run code, get AI hints & track streak