[NEW ALGORITHM] Intersection of Two Linked Lists

[SKG24]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name:

[Intersection of Two Linked Lists]

About:

Propose a new algorithm to be added to the repository
Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return null.

Input: listA = [4,1,8,4,5], listB = [5,6,1,8,4,5]

Output: Intersected at '8'

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

[pankaj-bind]

assigned