# 1721. Swapping Nodes in a Linked List

## LeetCode [1721. Swapping Nodes in a Linked List](https://leetcode-cn.com/problems/swapping-nodes-in-a-linked-list/)

### Description

You are given the `head` of a linked list, and an integer `k`.

Return *the head of the linked list after **swapping** the values of the* `kth` *node from the beginning and the*`kth` *node from the end (the list is **1-indexed** ).*

**Example 1:**

![](/files/v9Vgn3HuiSV0eE1naxta)

```
Input: head = [1,2,3,4,5], k = 2
Output: [1,4,3,2,5]
```

**Example 2:**

```
Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5
Output: [7,9,6,6,8,7,3,0,9,5]
```

**Constraints:**

* The number of nodes in the list is `n`.
* `1 <= k <= n <= 105`
* `0 <= Node.val <= 100`

### Tags

Linked List

### Solution

Perform the slow-fast pointers strategy to find the value of *the* `kth` *node from the end.* Swap it with the value of \_\_ *the* `kth` *node from the beginning.*

### Complexity

* Time complexity: $$O(n)$$
* Space complexity: $$O(n)$$

### Code

```go
func swapNodes(head *ListNode, k int) *ListNode {
	s, f := head, head
	for i := 1; i < k; i++ {
		f = f.Next
	}
	p := f
	for f.Next != nil {
		s, f = s.Next, f.Next
	}
	s.Val, p.Val = p.Val, s.Val
	return head
}
```


---

# 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://txfs19260817.gitbook.io/leetcode-go-notes/solutions/1721.-swapping-nodes-in-a-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.