# Partition List

## Description

Given a linked list and a value *x*, partition it such that all nodes less than *x* come before nodes greater than or equal to *x*.

You should preserve the original relative order of the nodes in each of the two partitions.

**Example:**

```
Input: head = 1->4->3->2->5->2, x = 3
Output: 1->2->2->4->3->5
```

## Solution

```cpp
class Solution {
public:
    ListNode *partition(ListNode *head, int x) {
        ListNode dummyLeft(0), dummyRight(0);
        ListNode *left = &dummyLeft, *right = &dummyRight, *curr = head;
        while (curr) {
            if (curr->val < x) {
                left->next = curr;
                left = curr;
            } else {
                right->next = curr;
                right = curr;
            }
            curr = curr->next;
        }
        left->next = dummyRight.next;
        right->next = nullptr;
        return dummyLeft.next;
    }
};
```


---

# 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://twchen.gitbook.io/leetcode/partition-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.