Answer: ByteDance OA Question 2024 February | Graphs | on-campus

Solution: Clone Graph — BFS with HashMap Approach To create a deep copy of a graph, we must traverse all nodes and replicate their connections without falling into infinite loops due to cycles. We use a HashMap to map original nodes to their cloned equivalents (originalNode -> clonedNode). This map serves two purposes: It stores the newly created nodes. It acts as a visited set. If an original node is in the map, it has already been cloned. We perform ...