Linked List 11: Intersection point of two Linked lists | Must Do Coding Questions | GeeksForGeeks
This video contains Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, …
from geeksforgeeks platform.
website link:
https://www.geeksforgeeks.org/must-do...
Topics covered in this video series are:
1.Arrays
• 1.1 ARRAYS | Must Do Coding Questions
2.String
• 1.2 STRING | Must Do Coding Questions
3.Linked List
• 1.3 LINKED LIST | Must Do Coding Ques...
4.Stack and Queue
5.Tree and BST
6.Heap
7.Recursion
8.Hashing
9.Graph
10.Greedy
11.Dynamic Programming
12.Divide and Conquer
13.Backtracking
14.Bit Magic
Linked List:
11: Intersection point in Y-shaped Linked list:
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 1:
Input:
LinkList1 = 3--6--9--common
LinkList2 = 10--common
common = 15--30--NULL
Output: 15
Example 2:
Input:
Linked List 1 = 4--1--common
Linked List 2 = 5--6--1--common
common = 8--4--5--NULL
Output: 8
Code Link:
https://github.com/krishna-gavas/Comp...
Intro Music :
• Video p