Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given the head of a singly linked list, swap every two nodes and return its head.
For example, given 1 -> 2 -> 3 -> 4, return 2 -> 1 -> 4 -> 3.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given the head of a singly linked list, swap every two nodes and return its head.
For example, given 1 -> 2 -> 3 -> 4, return 2 -> 1 -> 4 -> 3.