This video is part of the Linked List section in the GFG SDE Sheet.

In this video, we are Given two singly linked lists of size N and M, write a program to get the point where two linked lists intersect each other.

Example :

Input: 
Linked List 1 = 4->1->common
Linked List 2 = 5->6->1->common
common = 8->4->5->NULL

Output: 8

Explanation:

4              5
|              |
1              6
\             /
 8   -----  1 
  |
  4
  |
 5
 |
 NULL     

Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!

Do check out:-

Article: https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-Linked-lists/
Problem: https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1
SDE Sheet: https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/