Practice Swapping Nodes in a Linked List
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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).
Source: Swapping Nodes in a Linked List on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
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 <= 10^5
0 <= Node.val <= 100
Related LeetCode Problems
Practice more problems similar to Swapping Nodes in a Linked List.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.