LeetCode 1474: Delete N Nodes After M Nodes of a Linked List Solution

Master LeetCode problem 1474 (Delete N Nodes After M Nodes of a Linked List), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1474. Delete N Nodes After M Nodes of a Linked List

Easy

Linked List

Problem Explanation

Explanation:

To solve this problem, we can iterate through the linked list and skip M nodes, then delete the next N nodes. We need to be careful to handle edge cases where the list may not have enough nodes to delete.

Initialize a pointer current to the head of the linked list.
Iterate through the list, skipping M nodes and deleting the next N nodes until the end of the list is reached.
Ensure to update the next pointers appropriately to connect the nodes after deletion.

Time Complexity: O(N), where N is the number of nodes in the linked list. Space Complexity: O(1)

Solution Code

class Solution {
    public ListNode deleteNodes(ListNode head, int m, int n) {
        ListNode current = head;
        while (current != null) {
            int countM = m, countN = n;
            while (current != null && countM > 1) {
                current = current.next;
                countM--;
            }
            ListNode toDelete = current.next;
            while (toDelete != null && countN > 0) {
                toDelete = toDelete.next;
                countN--;
            }
            if (current != null) {
                current.next = toDelete;
                current = toDelete;
            }
        }
        return head;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1474 (Delete N Nodes After M Nodes of a Linked List)?

This page provides optimized solutions for LeetCode problem 1474 (Delete N Nodes After M Nodes of a Linked List) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1474 (Delete N Nodes After M Nodes of a Linked List)?

The time complexity for LeetCode 1474 (Delete N Nodes After M Nodes of a Linked List) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1474 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1474 in Java, C++, or Python.

Back to LeetCode Solutions