Copy List with Random Pointer ( with extra space ) | EP 23

[@husler7424]

I watched Striver and many other videos for this but didn't understand. Your explanation for LinkedList videos are really easy to get. Thanks Fraz.

[@RishavRaj-kn8nm]

Bhaiya aap bhaut accha explain karte ho.Mtlb ek dum basics se explain kiya aapne aur aaram aaram se pura question samjha diya.Superb

[@mohammadfraz]

🔥🔥 yahi to chahiye

[@desihiphop4998]

Question - accha
Explanation - accha*100
Bhaiya aapka question selection op hai bhut op !!!!!!

[@ankitgaur7428]

very easy explanation as compared to other youtubers. thanks

[@pankaj3518]

I also watched the same problem in other channels but didn't understand a bit.
Here, I found best explanation

[@kalpeshmali1476]

so depth explanation for complex problems ❤️❤️❤️❤️🔥🔥🔥🔥🔥

[@mohammadfraz]

Iska next vala dekho , or mazedar hai

[@kalpeshmali1476]

dekh liya bhaiya 👍

[@imtiyazuddin4827]

Really superb explanation

[@Wanna_be_01]

1. BRUTE APPROACH(Recursion + HashMap):-
--------------------------------------------------------------------------
class Solution {
public:
unordered_map m;
Node* dfs(Node* node){
if(!node) return NULL;
if(m.find(node) != m.end()) return m[node];
Node* newNode = new Node(node->val);
m[node] = newNode;
newNode->next = dfs(node->next);
newNode->random = dfs(node->random);
return newNode;
}
Node* copyRandomList(Node* head) {
return dfs(head);
}
};
// Time Complexity = O(n)
// Space Complexity = O(n)
2. OPTIMIZED APPROACH(HashMap) - By Fraz Bhaiya (from this lecture):-
----------------------------------------------------------------------------------------------------------
class Solution {
public:
Node* copyRandomList(Node* head) {
unordered_map m;
Node* temp = head;
while(temp != NULL){
Node *copy = new Node(temp->val);
m[temp] = copy;
temp = temp->next;
}
temp = head;
while(temp != NULL){
m[temp]->next = m[temp->next];
m[temp]->random = m[temp->random];
temp = temp->next;
}
return m[head];
}
};
// Time Complexity = O(n)
// Space Complexity = O(n)
-----------------------------------------------------------------------------------------------------------------
Enjoy Guys !!! ❤😉
I wrote here for revision purpose in future but you can use too for revision :)
And Thank to Fraz Bhaiya 🙏🥰❣🔥for whole content :)

[@akhileshkumarmishra3617]

Perfectly explained sir , I got here after 3 videos and understand this approach here completely .❣️❣️
One suggestion sir , please use relevent tags and #tags in your description so that your videos pop up as when i searched this problem your video doesn't appear .

[@shubhaamtiwary]

This is pure Gold

[@Sahilsharma-sk5vr]

best video for this question

[@SunnyGupta00]

This series is far better from paid courses, I have seen ❤️

[@mohammadfraz]

Thank you so much Sunny ❤️

[@mohammadfraz]

Complete bhi krli kya ?

[@SunnyGupta00]

@@mohammadfraz hn😌

[@thinkingmad1685]

@@SunnyGupta00 saat me code bhi kro bro ese dekhne se fayda nhi hota

[@SunnyGupta00]

@@thinkingmad1685 hn bhai ab thoda bhaot bhul gaya me 🥲🥲

[@harshitamendiratta71]

Amazing explanation

[@mohammadfraz]

Thanks Harshita

[@Androgamer-yx7tu]

Mast 🔥

[@mohammadfraz]

Thanks ❤️

[@fairyqueen373]

Suggestion: please use tags like #stack etc... i searched for stack playlist but ur videos didnt show up to me.. its an awesome playlist .. please do this in order to spread this good work

[@mdsufyankhan1029]

waited for this explanation , thanks bro ❤️

[@mohammadfraz]

You're welcome 😊

[@noob_clasher511]

what an interesting solution. Thanks.

[@purushottamkumar3140]

how easily he explained such a difficult question ? Thanks a lot Bhaiya

[@randeepsaini5491]

best content ever

[@HarshRaj-kp7gk]

sir, please make a video on (computer network) preparation in 3 days for placement
sir , "you forgot it this subject to make a video "
its humble request sir please make a video as soon as possible

[@factfactorial632]

great explanation bhaiya
I have a little doubt, we are using the map in which we are putting the nodes which are ultimately is going to be part of the answer
then why space complexity is O(N) it should be O(1)

[@ankitgarg2760]

hey @Fraz Can you pls provide the optimized solution Explanation of count pairs in array whose product is divisible by k? Rather than proving explanation of questions which are already well explained in several other channels.

[@mehrasmotivation6970]

Bhaiya video is very helpful bhaiya code ke saath comments bhi likh dijiye

[@ABC-ks8ir]

Good explanation bro

[@mohammadfraz]

Thanks bro

[@SunnyGupta00]

Reach++ 🔥

[@bite021devansh8]

🙏🙏

[@mohammadfraz]

Thanks

[@abhayrai1724]

Yaar bhai kisi ka nam to nhi lunga .....bt jo flow and sweetness wale mood se aap sikhate hoo sawaal ek point ke baad logic se khud code kr lete h 🤗🤗🤗 pr baad me repent hota h ki phle aapki hi video kyu nhi on ki😓...keep going ....🙏🥺😍

[@mdnadeem6343]

too good bhaiya

[@mohammadfraz]

Thanks bro

[@kritikasharma7687]

I'm not able to understand how the links have been made?

[@abdulrazzak2934]

nice problem nice video

[@mohammadfraz]

Thanks Abdul

[@amulop]

Bhaiya ye sare concepts enough ha interview ke liya ?
In linkedlist topic ?
If some remaining concepts left then please mention

[@mohammadfraz]

Enough hain

[@amulop]

@@mohammadfraz ok bhiaya
Stack and queue ab kaha se krna chaiye mujhe question jaisa yeh playlist ha waisae koi se

[@Androgamer-yx7tu]

360P pe v HD clarity ati h

[@mohammadfraz]

🔥 720 chala lo

[@madhabkafle8072]

💯

[@khizrshaikh9902]

First I want heart

[@mohammadfraz]

Ye lo ❤️