Intersection Node In Two Linkedlist Using Floyd Cycle Method
Try First, Check Solution later1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.
1. Given the heads of two singly linked-lists headA and headBInput Format
2. Return the node at which the two lists intersect.
3. If the two linked lists have no intersection, return null.
Input is managed for you.Output Format
Output is managed for you.Question Video
0 <= N <= 10^6Sample Input
14 12 8 7
7 2 6 5
Asked in Companies