Clone Graph | Leetcode 133 | DFS | Day-23

[@rawanfouda2291]

Great, your explanation is so clear and to the point! Thank you :)

[@AyushiSharmaDSA]

Welcome Rawan, glad it was helpful :)

[@itsme-z1s]

good, finally got the logic why we used map

[@AyushiSharmaDSA]

Glad it was helpful, thank you :)

[@abhaychaurasiya5548]

Great I wasn't able to understand the logic by other channels

[@AyushiSharmaDSA]

thank you abhay, glad it was helpful :)

[@dhanashreegodase4445]

makes sense, Thanks ayushi

[@AyushiSharmaDSA]

Welcome :)

[@gsmdfaheem]

Best explanation. Thank you so much

[@AyushiSharmaDSA]

You are welcome!🤗🤩 glad you liked it

[@zahidgul6337]

when we pass the 2 as the current in the dfs. Then the loop goes to the neighbors of 2, which are {1,3}. Assuming 1 goes first, so then we will go into the if statement and push into the vector. but what will be the result of the line of code, neighbour.push_back(dfs(current,map)) what are we pushing ino that vector? thanks

[@iuashrafi]

great !

[@AyushiSharmaDSA]

thank you :)

[@abhishekanand8574]

thanku mam

[@AyushiSharmaDSA]

Welcome :)

[@shantipriya370]

amazing..

[@AyushiSharmaDSA]

thank you, glad it was helpful :)

[@raviprakashyadav3741]

well explained, Ayushi

[@AyushiSharmaDSA]

Thanks Ravi 😊

[@jonas9375]

awesome explanation!

[@AyushiSharmaDSA]

thank you :)

[@sarthakkar4744]

Thanks for the effort.

[@AyushiSharmaDSA]

Welcome Sarthak, glad it was helpful :)

[@agarwalrahul3276]

nice explanation

[@AyushiSharmaDSA]

Thanks Rahul 🤗

[@aniketsharma4250]

Best explaination thanku

[@AyushiSharmaDSA]

Welcome Aniket, glad it was helpful :)

[@iiiii3536]

Nicely explained di

[@AyushiSharmaDSA]

Thank you Ishann :)

[@vibhavsharma2724]

Amazing explanation.

[@AyushiSharmaDSA]

thank you :)

[@atuldwivedi7677]

Nice explanation 🔥

[@AyushiSharmaDSA]

Thanks Atul :)

[@nimeshsingh6229]

nice

[@AyushiSharmaDSA]

thanks Nimesh :)

[@vaidanshkukreja8970]

Hey, Ayushi in your new video comments are turned off please turn them on (Sort Linked List VIDEO)

[@AyushiSharmaDSA]

Hi Vaidansh, thanks for letting me know. Don't know why UA-cam keeps on disabling comments. 🙂

[@vaidanshkukreja8970]

@@AyushiSharmaDSA Welcome 🤗
& Thanks to u for u r great explanations
Keep making videos like this 👍

[@girikgarg1268]

Ma'am can we do this question if we use a visited map like unordered_map instead of using the map between original graph and new Nodes?

[@AyushiSharmaDSA]

The thing is that we need to get the new node which which we will add in adjacency list of that new node which is created, so we will have to have map

[@gauravchaudhary6941]

not a good explanaition

[@AyushiSharmaDSA]

thank you for valuable feedback, will try harder next time :)

[@noobbot4654]

Why this question in leetcode has so many dislikes?

[@AyushiSharmaDSA]

No idea :)

[@jatingupta7015]

hi, is it good to use unordered_map globally as used below (to save some lines of code):
class Solution {
public:
unordered_map mp;
Node* cloneGraph(Node* node) {
if(!node) return node;
Node *ans = new Node(node->val);
mp[ans->val] = ans;
for(int i=0;ineighbors.size();i++){
if(mp.find(node->neighbors[i]->val)==mp.end()){
ans->neighbors.push_back(cloneGraph(node->neighbors[i]));
} else {
ans->neighbors.push_back(mp[node->neighbors[i]->val]);
}
}

return ans;
}
};

[@AyushiSharmaDSA]

Hi Jatin, as such there will no problem, but sometime may happen that it already has some previous values, so in starting of function, it would be better if you clear map first and then use it

[@jatingupta7015]

@@AyushiSharmaDSA Got it. Thanks.