# Linked List

- [2     Add Two Numbers](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/2-add-two-numbers.md)
- [19     Remove Nth Node From End of List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/19-removenth-node-from-end-of-list.md)
- [21 Merge Two Sorted Lists](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/21-merge-two-sorted-lists.md)
- [23 Merge k Sorted Lists](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/23-merge-k-sorted-lists.md)
- [24     Swap Nodes in Pairs](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/24-swap-nodes-in-pairs.md)
- [25     Reverse Nodes in k-Group](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/25-reverse-nodes-in-k-group.md)
- [61     Rotate List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/61-rotate-list.md)
- [82     Remove Duplicates from Sorted List II](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/82-removeduplicates-from-sorted-list-ii.md)
- [83     Remove Duplicates from Sorted List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/83-removeduplicates-from-sorted-list.md)
- [86     Partition List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/86-partition-list.md)
- [92     Reverse Linked List II](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/92-reverse-linked-list-ii.md)
- [109     Convert Sorted List to Binary Search Tree](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/109-convert-sorted-list-to-binary-search-tree.md)
- [138     Copy List with Random Pointer](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/138-copy-list-with-random-pointer.md)
- [141  Linked List Cycle](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/141-linked-list-cycle.md)
- [142     Linked List Cycle II](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/142-linked-list-cycle-ii.md)
- [143     Reorder List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/143-reorder-list.md)
- [147     Insertion Sort List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/147-insertion-sort-list.md)
- [148     Sort List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/148-sort-list.md)
- [160     Intersection of Two Linked Lists](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/160-intersection-of-two-linked-lists.md)
- [203     Remove Linked List Elements](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/203-removelinked-list-elements.md)
- [206     Reverse Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/206-reverse-linked-list.md)
- [234     Palindrome Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/234-palindrome-linked-list.md)
- [237     Delete Node in a Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/237-deletenode-in-a-linked-list.md)
- [328     Odd Even Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/328-odd-even-linked-list.md)
- [369     Plus One Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/369-plus-one-linked-list.md)
- [379     Design Phone Directory](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/379-design-phone-directory.md)
- [426     Convert Binary Search Tree to Sorted Doubly Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/426-convert-binary-search-tree-to-sorted-doubly-linked-list.md)
- [430     Flatten a Multilevel Doubly Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/430-flatten-a-multileveldoubly-linked-list.md)
- [445     Add Two Numbers II](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/445-add-two-numbers-ii.md)
- [707     Design Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/707-design-linked-list.md)
- [708     Insert into a Cyclic Sorted List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/708-insert-into-a-cyclic-sorted-list.md)
- [725     Split Linked List in Parts](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/725-split-linked-list-in-parts.md)
- [817     Linked List Components](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/817-linked-list-components.md)
- [876     Middle of the Linked List](https://protegejj.gitbook.io/oj-practices/chapter1/linked-list/876-middle-of-the-linked-list.md)


---

# Agent Instructions: 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:

```
GET https://protegejj.gitbook.io/oj-practices/chapter1/linked-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
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.