Solution: Odd Even Linked List
Understand how to manipulate a singly linked list in place by segregating nodes at odd and even indexes. Explore using pointer reassignments to maintain original relative order while meeting time and space complexity constraints. This lesson helps you implement an efficient solution to reorder nodes with constant extra space.
We'll cover the following...
Statement
Given the head of a singly linked list, rearrange the nodes so that all nodes at odd indexes appear first, followed by all nodes at even indexes.
The first node in the list is considered at odd index 1, the second at even index 2, and so on.
Within the odd group and the even group, the relative order of the nodes must remain the same as in the original list.
Return the head of the reordered linked list.
Note: You must solve the problem in
...