Intersection point of two linked lists

gambhirrahul0 · January 24, 2021, 5:52am

Refer this - https://ide.codingblocks.com/s/411676

Answer should be 4 (refer image below), it’s throwing ans as 5 still all test cases are getting passed.

Also, it’s throwing different addresses for 4. Why? The nodes are same then why the addresses are different?

mr.encoder · January 24, 2021, 7:25am

Same data type doesn’t mean it’s same node. Two intersection linked list are formed when you will 3->next equal to that node which has data 4 in it or vice versa. But as in question you can see you have to form 2 different linked list and then you have to find that node of same value not address. So logic is correct no issues in that.

Test cases aren’t designed for this test case that’s why all of them have been passed. if have any other doubts feel free to ask
You can also refer to my code will help you in understanding it better, as it was submitted on leetcode so it will help you too.

github.com

DivonilLiquid/Data-Structure-Algorithm/blob/master/Linked List/IntersectionofTwoLinkedLists.cpp

/**
Question:
Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:


begin to intersect at node c1.

 

Example 1:


Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5], skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,6,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.
 

Example 2:

This file has been truncated. show original

gambhirrahul0 · January 25, 2021, 4:13am

Can we further discuss it over the chat?

mr.encoder · January 25, 2021, 4:41am

My chat option is currently disabled right now, don’t know why. It will take some time to get restored. you can ask your query here.

mr.encoder · January 28, 2021, 11:26am

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.