Deep-copy a graph given as an adjacency list and return the copy's adjacency.
Input: nodes = {i: Node(i) for i in range(1, 5)}
for a, b in [(1, 2), (2, 3), (3, 4), (4, 1)]:
nodes[a].neighbors.append(nodes[b]); nodes[b].neighbors.append(nodes[a])
c = clone_graph(nodes[1])
print(c is not nodes[1], sorted(x.val for x in c.neighbors))
Output: True [2, 4]Your program must print exactly this output for these test calls.
undirected connected graph
Solve it in the live editor on this page — run on sample data, then submit against hidden tests.
{{ totalCount }} questions · {{ shHardPct }}% Hard. Data structures & algorithms interview problems in 13 patterns. Solve in Python, JavaScript or Java in your browser, run sample tests, then submit against hidden tests.
Guests can solve {{ freeLimit }} problems for free. Log in or sign up (free) to unlock everything, keep your streak and appear on the leaderboard. New to a topic? Learn it first in the DSA course.
{{ p.statement }}
{{ p.constraints }}
No submissions yet. Press Submit to judge your code against all tests.
The model solution and step-by-step explanation unlock when you solve this problem or after 3 unsuccessful submissions ({{ shFailsLabel }}). Struggling? Try the hints on the Question tab first.
{{ solutionCode }}
Create your free TechTown account to unlock every problem, track your progress, bookmark questions and keep preparing for interviews.