Find Intersection point of 2 Linked List | Lecture 22.8

Complete C++ Placement Course (Data Structures+Algorithm) : • C++ Full Course | C++...
Telegram: t.me/apnikaksh...
Instagram: / dhattarwalaman
Notes of this Lecture:

[@shaileshyadav6004]

mam apke padhane ke tarike se apka fan ho gaya hu best tarika hai apka koi chij samajhane ka

[@akshayan4012]

In the while loop of traversing the extra length, we need not check whether the pointer reaches NULL because we are traversing the extra length right, so that will never reach NULL within that loop

[@Aman-fz1ew]

yes thats correct

[@yashgaikwad5559]

what if second list given is null?

[@pranavJha93]

@@yashgaikwad5559 u can check the edge cases before writing the logic

[@codewithmePuneet]

@@pranavJha93 that's why you check if it is null or not. Because, logical error is still ok but null-pointer-access is fatal

[@abhaygupta73]

Best ever video I watched on placement series is course ne mjhe nayi ummed di h ki m bhi Google me placement le sakta hu AGR m mehnat kru

[@chotuagrawal3236]

Bhaiya with respect 🙏, Sirf bdi bdi batein krne s kuch ni hota apne promise kra apne 25 lakh subscribers k samne ki yeh course pura hoga and within time hoga but ab yeh course itna late hogya h and videos bhi ni dal rhi h or shyd yeh complete bhi na ho . Ap politics ki practice mt kro jo sirf jhoote vade krke bad m kuch ni krte Agr apse itna ni hora h then 25 lakh logo k samne itne commitment krne ki jrurat ni thi 🙏🙏. Srry agr jyada likha ho but asman k sapne dikha atleast zameen level ka toh or within time content toh do 🙏

[@sushilchaurasia]

Great ❤️❤️❤️❤️❤️ Di and bhaiya

[@suhailahmad3340]

Mai dusri channel say web deve.. Seekh raha tha but aap ki video dekii just demo tow, us course aur channel ko beech ma chood k aya for this amazing series ....always pray for u to reach the sky of ur dreams .....love u aman baiya and all the team members love u guys ...

[@AnshulCSE]

Wonderful way of explaining ❤️

[@niladriroy1665]

Abe 1 min mai samaj gya 😂😂 video to 9 min ka hai

[@AnshulCSE]

I'm folow this course from 1 video. So please use some common sense before passing comment..

[@AnshulCSE]

@@niladriroy1665 🙏🙏

[@Jonathan-ng4vw]

@@AnshulCSE *common please check your spelling

[@mrsmurf911]

@@Jonathan-ng4vw p1=head1; p2=head2;

[@KrishnaGupta-xd6xu]

Bhaiya please complete this course soon its already being very late , Lots of students waiting for this 🙏🙏🙏

[@prakhar16]

In second approach @3:15 we are calculating length of both LL by traversing both LL full length m and n so time complexity should not be O(m+n) ?

[@codewithmePuneet]

it is O(m+n)

[@PrakashKumar-vr9wc]

Thanks sis. It's very helpful for me

[@gauravkumar-ct5dh]

Hello Bhaiya!!! Eagerly waiting for rest of the course. You all did a great job but please don't delay the course.

[@tanyagupta4247]

Thankyou loved the approach!

[@prashantchakrawarti42]

Thanku DIDI 🙏🙏

[@dikshantgangwal9417]

Thanks a lot 😇

[@pinkeshpatel1940]

Wonderfully explained. Thanks for great content. :)

[@dipakdhakate5613]

Bhai placement lagi ky aapko

[@ayushsrivastava2397]

too good explaination.....cleared every thing

[@broskie_ceo1825]

You should also start a series on CYBER SECURITY, in future this industry will boom due to the technological advancement that is happening in today's world. Like what should you focus on during your starting phase and etc. Hope you read this comment and release a series on CYBER SECURITY!!!!

[@arnavraj9094]

You mean ethical hacking?

[@09ankitverma89]

bro y vala course aur web D toh poora ho jaye na

[@broskie_ceo1825]

@@arnavraj9094 that’s one side of it but there are other fields in this major like pen testing, offensive hacking, red team, defensive hacking, bug bounty and etc.

[@akashthoriya]

Please cover the most popular Leetcode challenges ko bhi include kar do bhai. [Difficulty = Hard vale]

[@dipakdhakate5613]

Bhai placement lagi ky apko

[@akashthoriya]

@@dipakdhakate5613 yes lag gai hai

[@kale-lb5pr]

node* intersectionY(node* head1, node* head2) { if (head1 == NULL || head2 == NULL) return NULL; node* temp = head1; map mpp; // Insert nodes of the first linked list into the map while (temp != NULL) { mpp[temp]=1; temp = temp->next; } // Traverse the second linked list and check for intersection temp = head2; while (temp != NULL) { if (mpp.find(temp) != mpp.end()) { return temp; } cout

[@Syntax-scribe-jsx]

thankyou mam!

[@SatyamGupta-yq1pt]

Mam apka ds bahut strong

[@AmarjeetKumar-to9ub]

Thank you :)

[@Learningdam]

Very clear explanation 👍

[@sahilsawal664]

Nicely Explanation Ma'am :) 🔥👍👌✌

[@adityaagarwal2324]

Why we have called head1 and head2 by reference, in the Q can I called without it??

[@SatendraKumar-mk1ui]

Please increase the frequency of the video.

[@krishnananddubey2870]

There is no need to add if condition in while(d) { ___} part as ptr1 will never become NULL on doing d-- as ptr1 is always greater than ptr2.

[@gauravupreti9340]

No, if second linked list is NULL, then this condition is needed.

[@ShivamSingh-tk5gu]

Yes ,this is a unnecessary condition because if second LL will null then first will completely traverse and then return -1 takes place

[@gauravupreti9340]

@@ShivamSingh-tk5gu Yes, you are right, there will be no segmentation fault in this case.

[@charannn3755]

when this course will be completed? my placements are starting from next sem(in 2-3 months) Aman bhaiya respond please..!

[@namanjain7710]

They won't respond what they said in the timeline video that till 6 Jan graphs will be completed but now not even linked list is complete

[@saurabhkumar5941]

bhai.. aur bhi channels hain wahan se dekle.. koi koi topics

[@shauncrasta]

i would recommend u to buy the gfg ds algo course for 2500...

[@charannn3755]

@@shauncrasta thank you

[@ayushanand2818]

Please increase the speed of uploading courses in this playlist as it s already delayed. Love ur work btw keep it up😇🙂

[@ghosthunternotclickbaitaka1997]

They are so behind of WHAT they promised

[@pritishpattnaik4674]

@@ghosthunternotclickbaitaka1997 bhai achha cheez banne mein time aur hard work dono lagta hai....and they are providing such a great course on youtube....so they should deserve more time

[@ghosthunternotclickbaitaka1997]

@@pritishpattnaik4674 arey bhai toh pehle badhi badhi batein kyu ki thi aese he boldete ki itna time lenge aur vese bhi last 10 videos mai koi animation bhi ni hai khaali slides he hai vese tum jese blind fans kabhi manoge he nahi

[@ghosthunternotclickbaitaka1997]

@@pritishpattnaik4674 and just rest of the comments on their recent videos of you don't believe me

[@pritishpattnaik4674]

@@ghosthunternotclickbaitaka1997 han bhai baat to tumhari bhi sahi hai😅...

[@zaminraza2316]

thanks bhaiya

[@ANANDKUMAR-jk9yp]

Crystall Clear Explanation!!

[@dipakdhakate5613]

Bhai placement lagi ky aapko

[@muhammadyaqoob8211]

Thansk for hard word for us

[@KodiLearn]

This is not animation. This is just powerpoint slides. These types of video can be made by anyone in just 4 hrs. Then why so late?

[@atharvkshirsagar5495]

Didi used some words of Aman Bhaiya... "Kar rahe honge"👈

[@pikubhattacharjee4802]

int intersectPoint(Node* head1, Node* head2) { Node* p=head1; Node* q=head2; while(p) { p->data+=2001; p=p->next; } while(q) { if(q->data>=1001) return q->data-2001; q=q->next; } return -1; }

[@Saurabh-gg9lv]

thanks dude

[@dipakdhakate5613]

Bhai placement lagi ky aapko

[@rajatagrwl9328]

Bhaiya , aap har Baar beech mein hi course chodd dete ho .... 😭😭😭 Itni late videos aaenge to kaise consistency maintain hogi?? Aap hi batao.....

[@hustlewithVaibhav]

Thank you didi

[@shivankkapila2954]

But length naalne ki khud ki time complexity O(m + n) nhi hogi?

[@manistrikes]

Yes...but coding contests mai pehle se hi functions mai length di hoti hai as a parameter...so we are not required to count their lengths in those contests.

[@pratushporwal5815]

i wanted to know why we used pos--; statement before loop void intersect(node* &head1, node* &head2, int pos){ node* temp1 = head1; pos--;

[@devanshpatil5326]

Bhaiya we are way behind the schedule!!

[@freekeys]

Length of the lambi linked list maja agai sunke👌😂

[@abhishekmaurya528]

How the time complexity of the method you used is lower than the first approach, as time complexity in finding the length will be O(n+m) + O(n) n being the longer linked list

[@nidhijawle3430]

Same doubt

[@kshitijgaikwad8343]

m+n TC is for finding the intersection and o(n) is for intersecting 2 linked lists... so basically for function intersection TC is m+n and for function intersect TC is n. please quote me if I'm wrong

[@subhradipbarik2032]

as O(n+m) is greater than O(n) thats why it will be O(n+m). and in 1st approach we need a graph , but in this approach with same time complexity we can do it with constant space complexity .

[@nidhijawle3430]

@@subhradipbarik2032 thanksss😄

[@subhradipbarik2032]

@@nidhijawle3430 my pleasure

[@saurabhkumar5941]

aage ki videos daalo bhaiii.. zaldi see

[@bhavesh5995]

Awesome , wonderful 👍🏻👍🏻

[@shivammaurya3451]

Thank u mam best explanation

[@rounikprashar6715]

Iski time complexity better kaise hai? Length nikalne me he O(n+m).

[@rivines]

Ye to dono case me lagegi na

[@vedant8002]

Keep up the good work 👌

[@dipakdhakate5613]

Bhai placement lagi ky aapko

[@hvsr184]

What if l1==l2 then what we do

[@acva]

Understood everything didi but this code will give error when the two lists are not linked but ptr1 and ptr2 get to null at the same point so to check for that the 'if' statement will be: if(ptr1 == ptr2 && ptr != NULL){ return ptr1->data; } :)

[@SyedMuhammadAli-tr4cg]

what if intersection point is at first node?? then we will use d = l1 - l2 or not??

[@yashvats4756]

PRO TIP-TO CREATE INTERSECTION JUST USE head2->next->next->next->next=head->next->next; TIP-My code shorter than this using same approach and also detatching a linked list from intersection if intersection is found- bool findintersection(node* head1 , node* head2) { if (head2next!=NULL) // or head1->next!=NULL { if (head2->next==head1->next) { head2->next=NULL; return 1; } head1=head1->next; head2=head2->next; } return 0; }

[@romangaming5177]

in line 94 and 95 ptr1 will never gets null because there is decremet in d,

[@shashankjha9108]

Insertattail jb head le rha hai to usmai head1 head2 kaisai dal sktai hai

[@charannn3755]

pehele tho time complexity 0(m+n) karke bathaye the..is it o(n) or o(m+n)..?

[@aanchalsharma1610]

Have u used hashing in this solution?

[@dipeshsharma7505]

awesome course helped a lot , how many more videos left to be uploaded for this course

[@nitinchandel4786]

Approximate 150 video left

[@dipakdhakate5613]

Bhai placement lagi ky

[@mohdhasnain3812]

at time 5:40 is this check ptr1==NULL is necessary because we are decrementing d also .. please help its line number 95

[@rounaksoni2817]

if the intersection point is the first point then?

[@tejasjoshi9140]

When is webd course comming

[@nitinchandel4786]

Bhai chalra hai apna college per hi

[@tejasjoshi9140]

@@nitinchandel4786 ha aaj upload hua

[@nitinchandel4786]

@@tejasjoshi9140 na bhai 10 din se bhi jyada hogye is course ko chalte

[@nitinchandel4786]

@@tejasjoshi9140 tum kha se ho or kya ker rahe ho

[@tejasjoshi9140]

@@nitinchandel4786 pata hai bhai sari videos dheki hai mene

[@rashadahmed2919]

videos daily basis pe upload ku nhi ho rahi hain? way toot raha hai poora

[@mr.jyotiranjankalta8098]

Bhai itna vi deri kyu aur video ayega vi ya nahi

[@prathvishetty9802]

Why java placement course is stopped 😣

[@omarmahmood6891]

because aman dhattarwal fired anuj bhaiya

[@nitinchandel4786]

@@omarmahmood6891 why aman bhaiyya fired anuj bhaiyya

[@omarmahmood6891]

@@nitinchandel4786 He wanted to start the new C++ course with highly trained professionals. So he stopped the Java course.

[@criminalcoder6307]

@@omarmahmood6891 lol duffer anuj Bhaiya leave Aman dhattarwal. Entire world knows who is better and who is just barking dog.

[@namanjain7710]

@@omarmahmood6891I don't think this will complete too becuz they are way way way more behind than what they promised see timeline video on his main channel

[@anildhasade3828]

Aman bhaiya told that lectures are divided into phase 1 and phase 2 is phase 1 completed already can any one please tell me

[@ghosthunternotclickbaitaka1997]

not even one fourth they are very late with the timeline which they gave see the timeline pdf on his main channel

[@ankurkhandelwal1375]

In the last while loop, can't we use OR operator instead of AND ?

[@funnykidz2837]

No , bcse if any of the ll will reach at end that means there is no intersection pt. In between.

[@yashvats4756]

WE CAN USE ANY , INFACT WE CAN JUST TAKE WRITE ANY ONE

[@Learnwith-jyoti]

what if case-1 : k==1 case-2 : k==length of linkedlist 🙄🙄

[@Simpleperson1414]

Sir, My college is teaching python in first year and java from 2nd year But I want to learn C++ because your teaching it, what to do ??

[@Mr__Impeccable]

I will watch it later coz I'm in 1st sem now..(just came to like the video) 🥴

[@MohammadKhan-ld1xt]

Bro if you are in the first semester I strongly advise you to see all the videos in his playlist . By the time you are in the 2nd year you can practice algorithm and by the end of 4th semester you will be doing exceptionally well. Just an advice , it's your choice though it will help you a lot 😉

[@Mr__Impeccable]

Thanks Bhai.... string tk Kiya hai abhi ..isi playlist k through

[@MohammadKhan-ld1xt]

@@Mr__Impeccable Sahi hein mein bhi 1st semester mein hi huu.

[@ernatertan1827]

❤️❤️

[@BCS-ot5bf]

Can anybody tell when this course going to complete so i could make proper time table

[@arnavraj9094]

1.5 months

[@namanjain7710]

It will take much more time they are not at the pace they promised that they'd be see they said 6 Jan graphs would be completed but now not even linkedlist is complete

[@anony12mous]

Why it gives error: 'i' does not name a type

[@r1sh149]

Iss video me to 0 animation tha sirf ek slide ke upar explain kiya and then code to baki videos upload karne main itna late kyu ho raha hai🙄🙄

[@srij_12]

Solution in java public class Solution { public int length(ListNode head) { ListNode temp = head; int count=0; while(temp!=null) { count++; temp = temp.next; } return count; } public ListNode getIntersectionNode(ListNode headA, ListNode headB) { int l1 = length(headA); int l2 = length(headB); int diff_len = Math.abs(l1-l2); ListNode ptr1 = null; ListNode ptr2 = null; if(l1>l2) { ptr1 = headA; ptr2 = headB; } else { ptr1 = headB; ptr2 = headA; } while(diff_len>0) { ptr1 = ptr1.next; diff_len--; } while(ptr1!=ptr2) { ptr1 = ptr1.next; ptr2 = ptr2.next; } return ptr1; } }

[@it_does_matter]

In the intersection code part where (head1,head2,int pos),what does that pos signify.Its value was taken as 3,is it position or value

[@Drogon-Gaming]

it means the third node from the head

[@bkbhushan5331]

I think it should be 5 as taken in the example of the video since we are intersecting the 5th node of the first linked list

[@VikashSingh-kg8xr]

7:08 kuchh samjh nhi aaya thoda dheeme dheeme

[@aas-vlog1]

Apni kaksha par java placement cource kab continue hoga aap wahin se bhi start kar sakte hain hame wahan se koi reply mila nhi Yaa fir aap hame age ka path bata do pls

[@itsaryanguys]

❤️🙏

[@pk4288]

can anyone explain line 41 me pos-- kyu kara gaya hai?

[@anumoynandy5811]

index=pos-1(that is why post decremeter operator is used)

[@harshpanwar1550]

🙏🙏🙏🙏🙏🙏

[@melodytunes2204]

agar hum length nikalenge tab bhi toh time complexity n+m hojayegi

[@kailashsahoo1209]

When python course is coming, bhaiya

[@nitanshuranjan2272]

which college

[@himanshusharma-tj1bt]

bhaiya video jaldi upload kiya karo

[@techsolutions3406]

Bhaiya agar video animated karna m time lag raha h tho video asa h upload kar di bina animation k par time par upload karo , hamre career ka sawal h ..agar time lagaga upload hone m tho asa bato ham or kahi se reference kare par kam se kam sahi bola k bta do juti tasali mat do jse phle kaha tha course lauch karta time ki January tak graph topic tak upload kar doge videos par abi tak tho linkedlist k video h sare upload nahi kiya 🤦😡😡😡😡😡😡😡😡😡😡😡😠😠😠

[@nickatytepro8690]

how ptr 1 becomes NULL if its length is already greater than d??

[@manistrikes]

If the second list of of 0 length ...then d= length of 1st list and we reach ptr1=Null

[@thedreamballer]

Bhaiya bas heart dedo bhaiya plzzzzzzzzz

[@melodytunes2204]

heart ❤❤

[@atulraj8381]

Can we don't use only head1 and head2 instead of &head1 and &head2 ? Please someone explain clearly

[@learningoverflow3138]

we want address of head1 head2 cos we r gonna be making temporary nodes to traverse

[@hustlewithVaibhav]

Bhaiya please upload next video

[@anu3872]

I'm getting a segmentation fault, can anyone pls help? #include using namespace std; class Node { public: int data; Node *next; Node(int val, Node *n = NULL) { data = val; next = n; } }; void insertAtTail(Node *&head, int val) { Node *n = new Node(val); if (head == NULL) { head = n; return; } Node *temp = head; while (temp->next != NULL) { temp = temp->next; } temp->next = n; } void display(Node *&head) { Node *temp = head; while (temp != NULL) { cout data next; } cout n) { head1 = head1->next; m--; } while (n > m) { head2 = head2->next; n--; } while (head1 != NULL && head2 != NULL) { if (head1 == head2) return head1->data; head1 = head1->next; head2 = head2->next; } return -1; } void makeIntersect(Node *head1, Node *head2, int pos) { Node *temp1 = head1, *temp2 = head2; while (temp1 != NULL && --pos) temp1 = temp1->next; while (temp2->next != NULL) temp2 = temp2->next; temp2->next = temp1; } int main() { Node *head1 = NULL, *head2; insertAtTail(head1, 1); insertAtTail(head1, 2); insertAtTail(head1, 3); insertAtTail(head1, 4); insertAtTail(head1, 5); insertAtTail(head1, 6); insertAtTail(head2, 9); insertAtTail(head2, 10); makeIntersect(head1, head2, 3); display(head1); display(head2); cout

[@NormieCyrox]

base case change karo

[@nitinchandel4786]

Is course me aproximate kitni video hogi pls koi btao

[@kaushittejwani5839]

how many videos are remaining in this playlist

[@nitinchandel4786]

150

[@sandeepkumarsingh4802]

kya yaar bhaiya...........aese kaise chalega..........january mein course complete karne ka promise kiya tha aapne.....ab lag raha hai march tak bhi khatam nhi hoga.

[@RishabhMazumdar]

Free mein quality content mil raha utna hi kafi nahi hai kya?

[@ytg6663]

@@RishabhMazumdar or Free me Dhokha bhi 👍

[@ytg6663]

Sahi bola vro sandip

[@mdekramuddin8534]

Hello..I want to know that does this playlist contains complete c++ and DSA ? I want to start

[@subhadeepghosh2813]

waiting for nxt one

[@sawi494]

Plz also provide full code 🙂🙂

[@gokulnaathb2627]

Nice explanation

[@seemasamridhi8348]

ethical hacking P lzz respond i wanna learn it....

[@anurag_goel6232]

No notes in description box

[@namanjain7710]

As expected yeh course bhi delay hogaya khaali pehle upar jadhate ho timeline waali video dekho sabh usmai 6 Jan tak graphs hona tha aur yaha toh linkedlist bhi khatam nahi kiya abh meri placements hai batao bhaiya aapke uspar depend tha pehele timeline galat di he kyu👺👺

[@shivamuttpaljha3134]

Bhai ye timeline wali video konsi hai Link de toh zara

[@shivamuttpaljha3134]

Bhai ye timeline wali video konsi hai Link de toh zara

[@namanjain7710]

@@shivamuttpaljha3134 kzbin.info/www/bejne/Y3qlfpp8l82VkLc

[@namanjain7710]

@@shivamuttpaljha3134 kzbin.info/www/bejne/Y3qlfpp8l82VkLc

[@057navneetdiwan6]

please upload the notes

[@katanaop3261]

please upload notes.

[@obamaengineer4806]

notes?

[@techsolutions3406]

😡😡😡😡😡Bhaiya agar video animated karna m time lag raha h tho video asa h upload kar di bina animation k par time par upload karo , hamre career ka sawal h ..agar time lagaga upload hone m tho asa bato ham or kahi se reference kare par kam se kam sahi bola k bta do juti tasali mat do jse phle kaha tha course lauch karta time ki January tak graph topic tak upload kar doge videos par abi tak tho linkedlist k video h sare upload nahi kiya 🤦😡😡😡😡😡😡😡😡😡😡😡😠😠😠

[@rachitjaiswal8249]

Theka nhi liya hai bhaiya ne

[@sarveshpatil5415]

Java animated kab ayega sir