> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/linked-list/intersection-of-linked-lists.md).

# Intersection of Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:

```

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗
B:     b1 → b2 → b3

```

begin to intersect at node c1.

> **Notes:**
>
> * If the two linked lists have no intersection at all, return null.
> * The linked lists must retain their original structure after the function returns.
> * You may assume there are no cycles anywhere in the entire linked structure.
> * Your code should preferably run in O(n) time and use only O(1) memory.

```java
public class Solution {
    public int length(ListNode node) {
        int len = 0;
        while (node != null) {
            len++;
            node = node.next;
        }
        return len;
    }

    public ListNode getIntersectionNode(ListNode a, ListNode b) {
        int len1 = length(a);
        int len2 = length(b);
        if (len1 > len2) {
            int diff = len1 - len2;
            while (diff > 0) {
                a = a.next;
                diff--;
            }
        } else if (len1 < len2) {
            int diff = len2 - len1;
            while (diff > 0) {
                b = b.next;
                diff--;
            }
        }
        while (a != null && b != null) {
            if (a == b)
                return a;
            a = a.next;
            b = b.next;
        }
        return null;
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://mayanktyagi3111.gitbook.io/interview-prep/linked-list/intersection-of-linked-lists.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.