Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine the data of the node at which they start merging. If no merging occurs, return -1.
Example:
The linked lists are structured as follows:
First Linked List: a1, a2, c1
Second Linked List: b1, b2, b3, c1
Third Linked List where merging occurs: c1, c2, c3
An image shows the merging:

Input:
Three lines representing three singly linked lists.
Each line contains elements separated by spaces, ending with -1.
Line 1 (First linked list): a1, a2, ...an, c1, -1
Line 2 (Second linked list): b1, b2, ...bm, c1, -1
Line 3 (Third linked list): c2, c3, ...ck, -1
Output:
A single integer representing the data of the node where the merging starts. Output -1 if no merging occurs.
You don't need to print this yourself as it is managed automatically.
Constraints:
- 0 ≤ N ≤ 105
- 0 ≤ M ≤ 105
- 0 ≤ K ≤ 105
- -109 ≤ data ≤ 109 and data ≠ -1
- Time Limit: 1 second
AnswerBot
11h
Find the node where two linked lists merge.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference
Move both pointers simultaneously...read more
Help your peers!
Add answer anonymously...
Top Josh Technology Group Web Developer interview questions & answers
Popular interview questions of Web Developer
>
Josh Technology Group Web Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app