Delete the Middle Node of a Linked List

Delete the Middle Node of a Linked List - Problem

You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list.

The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using 0-based indexing, where ⌊x⌋ denotes the largest integer less than or equal to x.

For n = 1, 2, 3, 4, and 5, the middle nodes are 0, 1, 1, 2, and 2, respectively.

Input & Output

Example 1 — Odd Length List

$ Input: head = [1,3,4,7,1,2,6]

› Output: [1,3,4,1,2,6]

💡 Note: List has 7 nodes. Middle is at index ⌊7/2⌋ = 3 (value 7). After deletion: [1,3,4,1,2,6]

Example 2 — Even Length List

$ Input: head = [1,2,3,4]

› Output: [1,2,4]

💡 Note: List has 4 nodes. Middle is at index ⌊4/2⌋ = 2 (value 3). After deletion: [1,2,4]

Example 3 — Two Nodes

$ Input: head = [2,1]

› Output: [1]

💡 Note: List has 2 nodes. Middle is at index ⌊2/2⌋ = 1 (value 1). After deletion: [1] - wait, that's wrong. Middle should be index 1, so delete node with value 1, leaving [2]. Actually, for n=2, middle index is 1, so we delete the second node, leaving [2].

Constraints

The number of nodes in the list is in the range [1, 10⁵]
1 ≤ Node.val ≤ 10⁵

Visualization

Tap to expand

Asked in

M Microsoft 25 a Amazon 18 G Google 15 f Meta 12

The optimal approach uses two pointers moving at different speeds to find the middle node in a single pass. The fast pointer moves 2 steps while the slow pointer moves 1 step. When the fast pointer reaches the end, the slow pointer will be just before the middle node, allowing us to delete it efficiently. Time: O(n), Space: O(1)

Common Approaches

✓ Hash Map

⏱️ Time: N/A Space: N/A

Fast-Slow Pointer (Optimal)

⏱️ Time: O(n) Space: O(1)

Fast pointer moves 2 steps while slow moves 1 step. When fast reaches end, slow is at middle. Track previous node to delete middle.

Two-Pass Approach

⏱️ Time: O(n) Space: O(1)

First pass counts total nodes to find middle position. Second pass traverses to that position and removes the node.

Algorithm Steps — Algorithm Steps

Code -

solution.c — C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>

typedef struct ListNode {
    int val;
    struct ListNode* next;
} ListNode;

ListNode* createNode(int val) {
    ListNode* node = (ListNode*)malloc(sizeof(ListNode));
    node->val = val;
    node->next = NULL;
    return node;
}

ListNode* solution(ListNode* head) {
    if (!head || !head->next) {
        return NULL;
    }
    
    // Handle case with only 2 nodes
    if (!head->next->next) {
        return head->next;
    }
    
    ListNode* slow = head;
    ListNode* fast = head->next->next;
    
    // Move fast 2 steps, slow 1 step
    while (fast && fast->next) {
        slow = slow->next;
        fast = fast->next->next;
    }
    
    // Delete middle node (slow->next)
    ListNode* toDelete = slow->next;
    slow->next = slow->next->next;
    free(toDelete);
    return head;
}

ListNode* arrayToList(int* arr, int size) {
    if (size == 0) return NULL;
    
    ListNode* head = createNode(arr[0]);
    ListNode* current = head;
    for (int i = 1; i < size; i++) {
        current->next = createNode(arr[i]);
        current = current->next;
    }
    return head;
}

void printList(ListNode* head) {
    printf("[");
    ListNode* current = head;
    int first = 1;
    while (current) {
        if (!first) printf(",");
        printf("%d", current->val);
        first = 0;
        current = current->next;
    }
    printf("]\n");
}

int parseArray(char* line, int* arr) {
    int count = 0;
    char* ptr = line;
    
    // Skip whitespace and find '['
    while (*ptr && *ptr != '[') ptr++;
    if (*ptr == '[') ptr++;
    
    while (*ptr && *ptr != ']') {
        if (isdigit(*ptr) || *ptr == '-') {
            arr[count++] = (int)strtol(ptr, &ptr, 10);
        } else {
            ptr++;
        }
    }
    
    return count;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    int arr[1000];
    int size = parseArray(line, arr);
    
    ListNode* head = arrayToList(arr, size);
    ListNode* result = solution(head);
    
    printList(result);
    
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

✓ Linear Growth

Space Complexity

✓ Linear Space

145.6K Views

Medium Frequency

~15 min Avg. Time

2.8K Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen