PROBLEM OF THE DAY : 13/02/2024 | Clone an Undirected Graph

Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Graph but also build up problem-solving skills.

In this problem, we are given a connected undirected graph with n nodes and m edges, with each node having a distinct label from 0 to n-1, create a clone of the graph. Each node in the graph contains an integer val and an array (neighbors) of nodes, containing nodes that are adjacent to the current node.

Note: If the user returns a correct copy of the given graph, then the system will print 1; in the case when an incorrect copy is generated or when the user returns the original node, the system will print 0.

For Example :    

class Node {
   val: integer
   neighbors: List[Node]
}

Example :

Input:
adjList = 
{
   {1, 3},
   {0, 2},
   {1, 3},
   {0, 2}
}
Output: 1

Explanation:
1 is the output that the driver code will print in case you successfully cloned the given graph.

Give the problem a try before going through the video. All the best!!!
Problem Link: https://www.geeksforgeeks.org/problems/clone-graph/1