Close
Topic list
EASY
25 mins
Topics (Covered in this problem)
Problem solved
Skill meter
-
-
Other topics
Problem solved
Skill meter
Strings
-
-
Matrices (2D Arrays)
-
-
Sorting
-
-
Binary Search
-
-
Stacks & Queues
-
-
Trees
-
-
Graph
-
-
Dynamic Programming
-
-
Greedy
-
-
Tries
-
-
Arrays
-
-
SQL
-
-
Binary Search Trees
-
-
Heap
-
-
Bit Manipulation
-
-
Solve problems & track your progress
Checkout your overall progress in every topic here
Become
Sensei
in DSA topics
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

# Intersection of Two Linked Lists

Contributed by
Arshit Babariya
Easy
0/40
Avg time to solve 25 mins
Success Rate 73 %
Share

## Problem Statement

#### For example:-

``````The given Linked Lists, where a1, a2, c1 is the first linked list, b1, b2, b3, c1 is the second linked list, and c1, c2, c3 is the third linked list which are merging at node c1.
``````

Detailed explanation ( Input/output format, Notes, Constraints, Images )
##### Sample Input 1 :
``````4 1 8 -1
5 6 1 8 -1
4 5 -1
``````
##### Sample Output 1 :
``````8
``````
##### Explanation For Sample Input 1:
``````As shown in the diagram the node with data is 8 at which merging starts
``````

##### Sample Input 2 :
``````1 9 1 2 -1
3 2 -1
4 -1
``````
##### Sample Output 2 :
``````2
``````
##### Sample Input 3 :
``````2 6 4 -1
1 5 -1
-1
``````
##### Sample Output 3 :
``````-1
``````
Auto
Console