Why Reorder Linked List in DSA Python?

The Big Idea

What if you could reorder a list perfectly without losing track or extra effort?

The Scenario

Imagine you have a list of friends lined up in order of when you met them. You want to rearrange them so the first friend is followed by the last friend, then the second friend, then the second last friend, and so on.

Doing this by hand means you have to remember positions, move people around carefully, and it gets confusing fast as the list grows.

The Problem

Manually rearranging a list like this is slow and easy to mess up. You might lose track of who goes where, accidentally skip someone, or spend a lot of time moving people back and forth.

It's also hard to keep the order correct without writing everything down or using extra space.

The Solution

Reordering a linked list with a clear method lets a computer do this quickly and correctly. It splits the list, reverses part of it, and then merges the two parts in the right order.

This way, the list is rearranged perfectly without losing anyone or needing extra memory.

Before vs After

✗ Before

friends = [1,2,3,4,5]
reordered = []
while friends:
  reordered.append(friends.pop(0))
  if friends:
    reordered.append(friends.pop())

✓ After

class Node:
  def __init__(self, val):
    self.val = val
    self.next = None

def reorder_list(head):
  # split, reverse, merge steps here

What It Enables

This lets you rearrange linked lists in a special order efficiently, enabling complex data manipulations like alternating sequences without extra memory.

Real Life Example

Think of a playlist where you want to alternate songs from the start and end to keep the mood fresh, without creating a new playlist or losing songs.

Key Takeaways

Manual rearrangement is slow and error-prone.

Reordering linked list uses splitting, reversing, and merging.

It efficiently rearranges without extra space.

Practice

1. What is the main goal of the Reorder Linked List problem?

easy

A. Remove duplicate nodes from the linked list

B. Sort the linked list in ascending order

C. Reverse the entire linked list

D. Rearrange the list so nodes alternate from start and end towards the center

Solution

1. Step 1: Understand the problem statement

   The problem asks to reorder the list so that nodes come alternately from the start and end, like L0 -> Ln -> L1 -> Ln-1 -> L2 -> Ln-2 ...

2. Step 2: Differentiate from other operations

   This is not sorting or reversing the entire list, but a specific pattern of rearrangement.

3. Final Answer:

   Rearrange the list so nodes alternate from start and end towards the center -> Option D

4. Quick Check:

   Reorder means alternate start/end nodes = A [OK]

Hint: Remember: reorder means alternate front and back nodes [OK]

Common Mistakes:

• Confusing reorder with sorting
• Thinking reorder means full reversal
• Assuming duplicates are removed

2. Which of the following Python code snippets correctly splits a linked list into two halves for reordering?

easy

A. slow, fast = head, head.next
while fast and fast.next:
slow = slow.next
fast = fast.next.next
second = slow.next
slow.next = null

B. slow, fast = head, head
while fast and fast.next:
slow = slow.next
fast = fast.next.next
second = slow.next
slow.next = null

C. slow, fast = head.next, head
while fast and fast.next:
slow = slow.next
fast = fast.next.next
second = slow.next
slow.next = null

D. slow, fast = head, head
while fast.next and fast.next.next:
slow = slow.next
fast = fast.next.next
second = slow.next
slow.next = null

Solution

1. Step 1: Understand slow and fast pointer technique

   Using slow and fast pointers starting at head, fast moves twice as fast to find middle.

2. Step 2: Check code correctness

   slow, fast = head, head while fast and fast.next: slow = slow.next fast = fast.next.next second = slow.next slow.next = null correctly initializes both at head and uses while fast and fast.next to move pointers safely.

3. Final Answer:

   Option B code snippet correctly splits the list into two halves -> Option B

4. Quick Check:

   Slow and fast start at head, fast moves twice = B [OK]

Hint: Start slow and fast at head; fast moves twice as fast [OK]

Common Mistakes:

• Starting fast at head.next causes off-by-one errors
• Incorrect while loop conditions causing crashes
• Not breaking the list by setting slow.next = null

3. What is the output linked list after reordering the list 1 -> 2 -> 3 -> 4 -> 5 -> null?

medium

A. 1 -> 5 -> 2 -> 4 -> 3 -> null

B. 5 -> 4 -> 3 -> 2 -> 1 -> null

C. 1 -> 2 -> 3 -> 4 -> 5 -> null

D. 1 -> 3 -> 5 -> 2 -> 4 -> null

Solution

1. Step 1: Identify the reorder pattern

   Reorder means first node, last node, second node, second last node, and so on.

2. Step 2: Apply pattern to given list

   For 1->2->3->4->5, reordered is 1->5->2->4->3.

3. Final Answer:

   1 -> 5 -> 2 -> 4 -> 3 -> null -> Option A

4. Quick Check:

   Alternate front and back nodes = C [OK]

Hint: Pick nodes alternately from front and back [OK]

Common Mistakes:

• Reversing entire list instead of reordering
• Keeping original order unchanged
• Skipping nodes or mixing order

4. Given the following code snippet for reordering a linked list, what is the bug?

def reorderList(head):
    if not head or not head.next:
        return
    slow, fast = head, head
    while fast and fast.next:
        slow = slow.next
        fast = fast.next.next
    second = slow.next
    slow.next = null
    prev = null
    while second:
        temp = second.next
        second.next = prev
        prev = second
        second = temp
    first, second = head, prev
    while second:
        temp1 = first.next
        temp2 = second.next
        first.next = second
        second.next = temp1
        first = temp1
        second = temp2

medium

A. The function does not return the head after reordering

B. The slow pointer should start at head.next to find middle correctly

C. The while loop merging two halves should check first and second, not just second

D. The code does not handle the case when the list has only one node

Solution

1. Step 1: Analyze function return behavior

   The function modifies the list in place but does not return anything, which is acceptable if list nodes are modified directly.

2. Step 2: Check if returning head is necessary

   Since the list is modified in place, returning head is optional; however, if used in some contexts, returning head is safer.

3. Step 3: Identify actual bug

   All other parts correctly find middle, reverse second half, and merge. The main issue is no return statement if function expected to return head.

4. Final Answer:

   The function does not return the head after reordering -> Option A

5. Quick Check:

   Missing return statement = A [OK]

Hint: Check if function returns the modified list head [OK]

Common Mistakes:

• Starting slow pointer at head.next causing wrong middle
• Merging loop condition incorrect causing infinite loop
• Ignoring single node edge case

5. You have a linked list 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> null. After applying the reorder linked list algorithm, what will be the final list? Also, explain why the middle node is chosen as it is.

hard

A. 1 -> 6 -> 2 -> 5 -> 3 -> 4 -> null; middle chosen to split list evenly

B. 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> null; no reordering done for even length

C. 1 -> 6 -> 2 -> 5 -> 3 -> 4 -> null; middle chosen as the first of the two middle nodes

D. 1 -> 5 -> 2 -> 4 -> 3 -> 6 -> null; middle chosen as the last node

Solution

1. Step 1: Apply reorder pattern to even length list

   For 1->2->3->4->5->6, reordered list is 1->6->2->5->3->4.

2. Step 2: Explain middle node choice

   Using slow and fast pointers, slow stops at the first middle node (3), splitting list into two halves evenly.

3. Final Answer:

   1 -> 6 -> 2 -> 5 -> 3 -> 4 -> null; middle chosen as the first of the two middle nodes -> Option C

4. Quick Check:

   Even length split uses first middle node = D [OK]

Hint: For even length, slow stops at first middle node [OK]

Common Mistakes:

• Choosing second middle node as split point
• Not reordering even length lists
• Mixing node order in final list