Tell me , How to create intersected ll?

#1

I can solve the problem , but how to take input of ll , and how to know where are they meeting?

#2

@raj.verma5454 hey you have to create linked list from the given input elements by takinh head and tail and adding node in front of tail and changing tail pointer to last node ,in this way you can take input.Now for intersection start traversing both list upto min(ll1 size,ll2 size) and if data of both nodes are same than that is intersection node.Hope you get it.

#3

I know how to create ll or how to take input. I am asking how to input or create intersected ll?

#4

like l1= 1->2->3->4->5->6->7 , l2 = 8->9->10->5->6->7 . I can take input in which (5,6,7) elements of l1,l2 have with different address. But in intersected ll (5,6,7) these number must be on same address for both the ll . How to achieve that?

#5

@raj.verma5454 hey,firstly take input of both linked list to intersection point and than create one node which is intersected node and attach that node to both node after that just attach the further elements of any list after that intersected node.

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.