{"type":"rich","version":"1.0","provider_name":"Transistor","provider_url":"https://transistor.fm","author_name":"Programming Tech Brief By HackerNoon","title":"Clone Graph Blind75 LeetCode Problem","html":"<iframe width=\"100%\" height=\"180\" frameborder=\"no\" scrolling=\"no\" seamless src=\"https://share.transistor.fm/e/fe2cfaed\"></iframe>","width":"100%","height":180,"duration":211,"description":"\n        This story was originally published on HackerNoon at: https://hackernoon.com/clone-graph-blind75-leetcode-problem.\nClone Graph Blind75 LeetCode Problem\nCheck more stories related to programming at: https://hackernoon.com/c/programming.\n            You can also check exclusive content about #java, #data-structures, #leetcode, #algorithms, #dfs, #programming, #graph, #blind75, #hackernoon-es,  and more.\nThis story was written by: @rakhmedovrs. Learn more about this writer by checking @rakhmedovrs's about page,\n            and for more stories, please visit hackernoon.com.\nTask description: Given a reference of a node in a connected(https://en.wikipedia.org/wiki/Connectivity)Connected_graph) Return a deep copy of the graph. Each node in the graph contains a value (`int`) and a list (`ListNode`) of its neighbors. The graph is represented in the test case using an adjacency list. The given node will always be the first node with `val = 1` You must return the copy of a given node as a reference to the cloned graph.","thumbnail_url":"https://img.transistorcdn.com/KhCapPSRkLGL2Xw8888yuChkNRWthaKapLYTvNdu4W4/rs:fill:0:0:1/w:400/h:400/q:60/mb:500000/aHR0cHM6Ly9pbWct/dXBsb2FkLXByb2R1/Y3Rpb24udHJhbnNp/c3Rvci5mbS9zaG93/LzQxMTY2LzE2ODM1/ODIzMzAtYXJ0d29y/ay5qcGc.webp","thumbnail_width":300,"thumbnail_height":300}