CLONE GRAPH | LEETCODE # 133 | PYTHON BFS SOLUTION

[@roywastaken]

your solutions are lowkey better than Neetcode's and that's crazy

[@crackfaang]

I’d rather have his subscriber count though 😂

[@Rutik9999]

@@crackfaang lol 🤣

[@sarayarmohammadi3376]

Please keep posting videos. I really like your solutions better than NeetCode most of the times.

[@janarboke4005]

I like how you went through what the hashmap will look like in the beginning, very clear

[@noextrasugar]

I don't understand how this channel doesn't have 500k+ subscribers??!

[@TAEWANKIM88]

I like this version of using BFS. Thanks!

[@zungulutrungu6407]

hey king could you please do 1129. Shortest Path with Alternating Colors ? thanks and keep uploading!!

[@crackfaang]

Sure, let me add it to my work queue

[@H4WKGAMING]

great explanation!

[@crackfaang]

Thanks for your support and make sure to subscribe so you don’t miss future videos!

[@H4WKGAMING]

@@crackfaang can you please do Product of Array Except Self?

[@l501l501l]

Very intuitive compared to DFS version in most of the videos.

[@yingxie9974]

very good !

[@user-vt8dd6fj7v]

Am super confused on line 19

[@derilraju2106]

You are just pushing each neighbor into the neighbors list of the parent node

[@subee128]

Thanks

[@derilraju2106]

If someone is looking for equivalent DFS solution: from collections import deque class Solution: def cloneGraph(self, node: 'Node') -> 'Node': if not node: return None cloned = {} cloned[node] = Node(node.val,[]) # DFS solution def dfs(node): if not node: return None for neigh in node.neighbors: if not neigh in cloned: cloned[neigh] = Node(neigh.val,[]) dfs(neigh) cloned[node].neighbors.append(cloned[neigh]) dfs(node) return cloned[node]