Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Intersection of Two Linked Lists
Bookmark
Hash Set
Two Pointers
Input
Example 1
Example 2
No intersection
Intersection at head of A
Simple case
listA
=
[4, 1]
,
listB
=
[5, 6, 1]
,
intersection
=
[8, 4, 5]
A
B
4
1
5
6
1
8
4
5
headA
headB
A
B
4
1
5
6
1
8
4
5
headA
headB
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
A
B
4
1
5
6
1
8
4
5
headA
headB
curr
algo
master
.
io
Step:
List A: 4→1→8→4→5, List B: 5→6→1→8→4→5
0 / 12
Input
Example 1
Example 2
No intersection
Intersection at head of A
Simple case
listA
=
[4, 1]
,
listB
=
[5, 6, 1]
,
intersection
=
[8, 4, 5]
0 / 12
algo
master
.
io
Step:
List A: 4→1→8→4→5, List B: 5→6→1→8→4→5
