Hello guys, it doesn't matter how smart or dumb or lucky you are, if you are consistent enough you can outwork all the people who you think are talented or smarter than you. #consistancy #linked list
we know you are observing a constant decline in views,but its just because we are left behind and your content is amazing,Thanks for creating the content and for your efforts
Maine khud se bhi kaafi socha for any brute force approach. I was very close to the solution that u provided. Really felt amazing by my improvement. Thanks bhaiya!
sections of code to the original diagram/ approach you've made on the iPad...? Requesting this because it gets unnecessarily hard to visualize all the code so fast mentally! In other words, explain each of the lines of different sections of code, comparing it with the iPad approach after you're done coding. Explain like... this line is doing this and this one is doing this, back in the approach rather than just simply wafting over the sections like at 54:07 which we already understand. This method of teaching would really help and prove to be icing on the cake for a lot of us. Thanks for your consistent efforts!
pheli bar gfg pe love bhai ka solution dekhe bina one shot mein probelm nikal li (of course approach 1 se) . Inutution a raha hai . Thank you! you rock
Aapka content itna acha hai bhaiya ki aisa lag raha hai aap placement laga ke hi chodoge , waise abhi aaphi ka video dekh raha tha pointers wala , kya easily samjhaya hai , thanks big brother ❤️
class was really amazing and I felt it very cool in coding, Thanks sir for this one and truly speaking, This is the first time that I am saying someone thanks for this kind of teaching. Thanks to make these video and it is helping me a lot in getting my goals.😊😊😊😊
51:25 nahi aa sakta upar waale logic me temp->next me NULL. Kyunki temp traverse to original list ke element ko kar raha hai aur Har original node ke baad uska clone node toh ana mandatory hai to temp -> next kabhi bhi NULL nahi hoga kyunki wo humesa apne clone ke counterpart ko point karega.
Thank you bhaiya for providing nicest dsa content and it's quality is just the best out there....No other course even come close to the simplicity and quality of this content....so thank you again and keep going
Bhaiya m thoda peeche chal rha tha qki Maine 450 and leetcode k problems bhi lagayei Linked list pr toh frequency slow mat krna, map wali approach toh Maine khud se sochi thy but jo 3rd approach thy that was like 🔥🔥 PS: Thank you so much bhaiaya this question was like🔥
We need Handwritten Notes rest of Lectures, It's really time savings. When we have to revise, then I think all of us use that beautiful Notes. Otherwise it again a long time to see video again.
babbar bhai absolutely loved loved loved.... the way you built it...Just one thing, please don't use red to write things down on dark background...use some other colors which make contrast better and readable.
Hiii.. just one suggestion -> at 46:40 you can also use while(temp != NULL){ if(temp -> arb != NULL){ temp -> next -> arb = temp -> arb -> next; } else{ temp -> next -> arb = temp -> arb; } temp = temp -> next -> next; } because temp -> next won't be equal to NULL ever.
Could understand the 2nd approach but not the code like around 22:18 . In the next ones, can you please explain each line of code back in the diagram on the iPad once you're done coding...? Because it gets harder to visualize so much code mentally and ultimately hard to keep track of what step does what behind the scenes.
class Solution { private: //insert function for inserting nodes in clone list void insert(Node* &head , Node* &tail , int data){ Node*temp = new Node(data); if(head == NULL){ head = temp; tail = temp; return ; }
Hey guys, do you guys code along with bhaiya and submit the solution Or you code by self after watching the lecture ? Just curious about different study approaches.
present hai bhaiya. but abi mai series follow nhi kr pa raha hu,due to some reason but aap videos daalte rhna........ mai yahi se padhunga..bhaiya...thank you so much
bhaiya you are brilliant..... this is the first time for me when i guessed approach3 accurately. seriously this series is very helpful and content quality is very very good from basics to advance. keep it up!! Thankyou
41.6 time ..... can't read the line because using colour to write ...I am watching every vedio and only the could not do much practice of these problems .....I am doing covering every problem and want to do more practice by solving concern ing problem on leet code ...what is about 450 questions to solve while practicing theses questions ..will be more better .?
At 37:38 What's the difference between OriginalNode -> next = CloneNode ; ---( 1 ) and CloneNode = OriginalNode -> next; ---( 2) ??? 🤔 How do I say both (1) and (2) to myself in Hindi mentally...?
I am not able to understand how to implement code using classes why not not main () if anyone knows how he implemented plz tell or give the link of video in which he had explained
I watched first video of yours to understand basic concepts of linked list then I open leetcode with linkedlist structured problems then I end up by finishing that with finishing this playlist .. lol 😂 great work .. it took me around 1 month to understand concepts of linkedlist and in this my oops concepts were also brushed up
Present bhaiya video dekh kar maja aa rahe haa bhaiya a small suggestion from my side is bhaiya please system designeing v kar wa dena Bhaiya as many company is asking now a days
Bhaya ab kucch nhi he bas vo bacche dekh rahe he jo serious he pehele jinka khun garam tha ab thanda ho gaya ab jo dekh rahe he vo sab MNC ya Unicorn vale he
I have a doubt that when we declared node*=orginalnode ->next; then originalNode->next=cloneNode; in line 58,59 aproach 3 how we can have 2 values of next ,why we are able to declare next as a variable
![Lecture 53: Merge Sort in Linked List [ Theory + Implementation ]](http://i.ytimg.com/vi/rM5EEA_rbNY/mqdefault.jpg)
![Lecture 53: Merge Sort in Linked List [ Theory + Implementation ]](/img/tr.png)
Hello guys, it doesn't matter how smart or dumb or lucky you are, if you are consistent enough you can outwork all the people who you think are talented or smarter than you.
#consistancy #linked list
🙂yeah man u are right
Bhaiya linked list m thoda sa confusion hora tha starting m par fir do teen video dekhne k baad ab maje aa rhe h linked list k questions karne m
3 different Approaches for Single Question. Itna to koi paid courses me bhi nhi btata .Thanks a lot bhaiyaa ❤❤❤
we know you are observing a constant decline in views,but its just because we are left behind and your content is amazing,Thanks for creating the content and for your efforts
yes correct
No one can match the commitment and dedication of Love Bhaiya towards teaching and making sure we comprehend the concept easily
Maine khud se bhi kaafi socha for any brute force approach. I was very close to the solution that u provided. Really felt amazing by my improvement. Thanks bhaiya!
33:04 after listening to this approach, i was like 🤯🤯, aisa kaise soch bhi sakthaa hai
sections of code to the original diagram/ approach you've made on the iPad...? Requesting this because it gets unnecessarily hard to visualize all the code so fast mentally!
In other words, explain each of the lines of different sections of code, comparing it with the iPad approach after you're done coding. Explain like... this line is doing this and this one is doing this, back in the approach rather than just simply wafting over the sections like at 54:07 which we already understand. This method of teaching would really help and prove to be icing on the cake for a lot of us. Thanks for your consistent efforts!
pheli bar gfg pe love bhai ka solution dekhe bina one shot mein probelm nikal li (of course approach 1 se) . Inutution a raha hai . Thank you! you rock
BHAIYA JI BOHOT TEZZ BOHOT HI JADDA BADIYA APPROACH 3 MAZA HI AHHHGYA,
APPKI ENERGY EK ALAG HI LEVEL HAI THANKS BHAI.👌👌👌👌
Hashmap solution was easily understandable, I won't remember Approach 3
wahh bhiyaa maja aa gyaa..❤ sub smaj aa gya hume 🤩🤩👍👍
Though the video was long but I couldn't get such a great explanation in any UA-cam video! great content.
Aapka content itna acha hai bhaiya ki aisa lag raha hai aap placement laga ke hi chodoge , waise abhi aaphi ka video dekh raha tha pointers wala , kya easily samjhaya hai , thanks big brother ❤️
placement hui fir?
i watched this video 2 times 🤩🤩fir bhi borring nhi laga just bcz of your amazing explaination bhaiya 🔥🙌
class was really amazing and I felt it very cool in coding, Thanks sir for this one and truly speaking, This is the first time that I am saying someone thanks for this kind of teaching. Thanks to make these video and it is helping me a lot in getting my goals.😊😊😊😊
Shaaandaaar series chal rha h bhaiya. 🔥🔥
solid lecture babbar bhaiya
Pahale linked list mere faad dete the ab me linked list ki faad deta hu...time change bro ||......LOVE YOU BRO.........||
pushing limits... last approach me maza he aagai bhaiya code krne me
mai to kal mazaak me boli thi video chahiye.... aapne to sach me daaldi... kya aadmi ho yarr 😂😂 chalo anyway.... thank you🖤🖤
Rula diya is question ne
51:25 nahi aa sakta upar waale logic me temp->next me NULL. Kyunki temp traverse to original list ke element ko kar raha hai aur Har original node ke baad uska clone node toh ana mandatory hai to temp -> next kabhi bhi NULL nahi hoga kyunki wo humesa apne clone ke counterpart ko point karega.
Thank you bhaiya for providing nicest dsa content and it's quality is just the best out there....No other course even come close to the simplicity and quality of this content....so thank you again and keep going
Love this course🥰...
live talk se motivation => reminding to be consistent in course😇
Bhaiya m thoda peeche chal rha tha qki Maine 450 and leetcode k problems bhi lagayei Linked list pr toh frequency slow mat krna, map wali approach toh Maine khud se sochi thy but jo 3rd approach thy that was like 🔥🔥
PS: Thank you so much bhaiaya this question was like🔥
Bhaiya awesome....
Bht maza aa rha.....❤️
nice vid keep doing and also take care of your health! you've been working hard!!
Loved this course ❤❤
Thank you Bhaiya🔥🔥
We need Handwritten Notes rest of Lectures, It's really time savings.
When we have to revise, then I think all of us use that beautiful Notes.
Otherwise it again a long time to see video again.
khud bana le na bhai.
Amazing approach bhaiya 🔥🔥🔥
Thanks for video 🙏🙏🙏🙏
Best DSA series out there thank you for this😊
24:06 arb = arbitrary.
Sahi video bana di 👍👍.......isme rehti thi mujhe thoda confusion
High effort and high quality content
Thank you bhaiyyq
babbar bhai absolutely loved loved loved.... the way you built it...Just one thing, please don't use red to write things down on dark background...use some other colors which make contrast better and readable.
thanks for giving the amazing content in amazing way
Crystal clear explanation bhai!
Hiii.. just one suggestion -> at 46:40 you can also use
while(temp != NULL){
if(temp -> arb != NULL){
temp -> next -> arb = temp -> arb -> next;
}
else{
temp -> next -> arb = temp -> arb;
}
temp = temp -> next -> next;
}
because temp -> next won't be equal to NULL ever.
Correct ✅
Yes , the condition of temp->next getting NULL will never be true . We can remove also
Consistency++
Maja aa rha boht, Enjoying this course
Could understand the 2nd approach but not the code like around 22:18 . In the next ones, can you please explain each line of code back in the diagram on the iPad once you're done coding...? Because it gets harder to visualize so much code mentally and ultimately hard to keep track of what step does what behind the scenes.
class Solution {
private:
//insert function for inserting nodes in clone list
void insert(Node* &head , Node* &tail , int data){
Node*temp = new Node(data);
if(head == NULL){
head = temp;
tail = temp;
return ;
}
else{
tail->next = temp;
tail = temp;
}
return;
}
public:
Node* copyRandomList(Node* head) {
Node* temp = head;
Node* clonehead = NULL , *clonetail = NULL;
while(temp!=NULL){
int data = temp->val;
insert(clonehead , clonetail , data);
temp = temp->next;
}
map mp;
temp = head;
Node* p =clonehead;
while(temp!=NULL && p!=NULL){
mp[temp] = p;
temp = temp->next;
p = p->next;
}
p = clonehead;
temp = head;
while(p!=NULL && temp!=NULL){
p->random = mp[temp->random];
temp=temp->next;
p = p->next;
}
return clonehead;
}
};
Incredibly well explained, and the last approach is lit🔥
Hey guys, do you guys code along with bhaiya and submit the solution Or you code by self after watching the lecture ? Just curious about different study approaches.
2nd one..
try to solve it before watching the video at 2x
Attendence done bhaiya 🙌🏼
Great bhaiya❤
Best DSA course
present bhaiya !!! awesome series ❤️❤️❤️
Sab samajh aagya..thanks for the video!!
masterclass bhai.. love from BD
Loving the series.
Thank you bhaiya bahut achche se explain kiye 🫡
Nice explanation of such a topic😭😭
Bhaiya aapki consistency op hai ...
bhai log jo log view kar rhe ho, kam se kam like to karte jao, kuch to support karo yaar, humbble request.
Thanks
present hai bhaiya. but abi mai series follow nhi kr pa raha hu,due to some reason but aap videos daalte rhna........ mai yahi se padhunga..bhaiya...thank you so much
Attendance done♥️
Bhaiyaaaa i m your big fan ❣️❣️❣️😭... I swear... Thanks alot ❣️
whole day spent in this (skill issue)
us
Consistency++
Motivation girne nahi deni✊
I'm lagging a bit in lectures but will be there soon✌️
ok updates?
Thanks bhaiya for this explaining this amazing question... mja hi aa gya aapse ye question samajkr
bhaiya you are brilliant..... this is the first time for me when i guessed approach3 accurately.
seriously this series is very helpful and content quality is very very good from basics to advance.
keep it up!!
Thankyou
last method was just wow loved the explanation. thankyou so much bhaiya
Hi
Which yr bro
@@kravi8034
1st year
approach 3 was awesome bhai!
Attendance marked
41.6 time ..... can't read the line because using colour to write ...I am watching every vedio and only the could not do much practice of these problems .....I am doing covering every problem and want to do more practice by solving concern ing problem on leet code ...what is about 450 questions to solve while practicing theses questions ..will be more better .?
Concept++ 🔥🔥
love u babbar bhaiyaa
Thank You So Much BHRATA SHREE !!!!!
kafi asan banaya apne yeh...
THANKYOU FOR THE COURSE.................................
content is love
maza aagaya bhai approch sunke
At 37:38
What's the difference between
OriginalNode -> next = CloneNode ; ---( 1 )
and
CloneNode = OriginalNode -> next; ---( 2) ??? 🤔
How do I say both (1) and (2) to myself in Hindi mentally...?
originalnode ka next clonenode ko point krr raha h and second point me clone node , originalnode ka next jise point krr rha hai uske equal h
Amazing explanation bhaiya 🥰😄😄😄
bhaiya for creating a new clone linked list there is also using a space of O(n).So, how the last approach is of O(1)
Present bhaiya 🔥🔥❤️
Bhaiya mauj kr dii
Thanks bhaiya for giving very handy solution of todays Question
At 45:06,if we are creating Node*next for every originalNode , then isn't space complexity again O(n)?
Yes, I think so.
I am not able to understand how to implement code using classes why not not main () if anyone knows how he implemented plz tell or give the link of video in which he had explained
Awesome bhaiya..
✌️✌️
yo yo yo question me maje aa rhe hai
I watched first video of yours to understand basic concepts of linked list then I open leetcode with linkedlist structured problems then I end up by finishing that with finishing this playlist .. lol 😂 great work .. it took me around 1 month to understand concepts of linkedlist and in this my oops concepts were also brushed up
Thanks a lot Bhaiya
Attandenc marked consistency op😎
51:33
In line 74 of code wont it throw error if temp-> next =Null?
bhaiya i am having runtime error in the approach iwhere we created the map;
thnx bhaiya :)
completed on 13/7/24
Present bhaiya video dekh kar maja aa rahe haa bhaiya a small suggestion from my side is bhaiya please system designeing v kar wa dena Bhaiya as many company is asking now a days
Present bhaiya ✋
225 ✅completed 👍Liked 06:15
Thankyou so much bhaiya for this amazing course>>>>>>
bahiya distinct nodes val pe hi ye question banega na? duplicates ke sath to nahi denge na?
you are the best bhaiya..
amazing explanation 👏👏
Bhaya ab kucch nhi he bas vo bacche dekh rahe he jo serious he pehele jinka khun garam tha ab thanda ho gaya ab jo dekh rahe he vo sab MNC ya Unicorn vale he
I have a doubt that when we declared
node*=orginalnode ->next;
then originalNode->next=cloneNode;
in line 58,59 aproach 3
how we can have 2 values of next ,why we are able to declare next as a variable
Yes we can assume it as one next is indicating the next pointer while the other is data member of Class created
Babbar is love ❤️
Present bhaiya❤
Bhaiya mast question tha maja aaya....😀😀😀 Lekin bhaiya red colour use mat kro... Not that much visible....