Javascript Program To Delete N Nodes After M Nodes Of A Linked List Last Updated : 05 Sep, 2024 Comments Improve Suggest changes Like Article Like Report Given a linked list and two integers M and N. Traverse the linked list such that you retain M nodes then delete next N nodes, continue the same till end of the linked list.Difficulty Level: Rookie Examples:Input:M = 2, N = 2Linked List: 1->2->3->4->5->6->7->8Output:Linked List: 1->2->5->6Input:M = 3, N = 2Linked List: 1->2->3->4->5->6->7->8->9->10Output:Linked List: 1->2->3->6->7->8Input:M = 1, N = 1Linked List: 1->2->3->4->5->6->7->8->9->10Output:Linked List: 1->3->5->7->9The main part of the problem is to maintain proper links between nodes, make sure that all corner cases are handled. Following is C implementation of function skipMdeleteN() that skips M nodes and delete N nodes till end of list. It is assumed that M cannot be 0. JavaScript // Javascript program to delete N nodes // after M nodes of a linked list // A linked list node class Node { constructor() { this.data = 0; this.next = null; } } // Function to insert a node at // the beginning function push(head_ref, new_data) { // Allocate node let new_node = new Node(); // Put in the data new_node.data = new_data; // Link the old list off the // new node new_node.next = (head_ref); // Move the head to point to // the new node (head_ref) = new_node; return head_ref; } // Function to print linked list function printList(head) { let temp = head; while (temp != null) { console.log(temp.data); temp = temp.next; } } // Function to skip M nodes and then // delete N nodes of the linked list. function skipMdeleteN(head, M, N) { let curr = head, t; let count; // The main loop that traverses // through the whole list while (curr != null) { // Skip M nodes for (count = 1; count < M && curr != null; count++) curr = curr.next; // If we reached end of list, // then return if (curr == null) return; // Start from next node and delete // N nodes t = curr.next; for (count = 1; count <= N && t != null; count++) { let temp = t; t.next; } // Link the previous list with // remaining nodes curr.next = t; // Set current pointer for next // iteration curr = t; } } // Driver code /* Create following linked list 1.2.3.4.5.6.7.8.9.10 */ let head = null; let M = 2, N = 3; head = push(head, 10); head = push(head, 9); head = push(head, 8); head = push(head, 7); head = push(head, 6); head = push(head, 5); head = push(head, 4); head = push(head, 3); head = push(head, 2); head = push(head, 1); console.log( "M = " + M + ", N = " + N + " Given Linked list is :"); printList(head); skipMdeleteN(head, M, N); console.log("Linked list after deletion is :"); printList(head); // This code is contributed by gauravrajput1 OutputM = 2, N = 3 Given Linked list is : 1 2 3 4 5 6 7 8 9 10 Linked list after deletion is : 1 2 3 4 5 6 7 8 9 10 Complexity Analysis:Time Complexity:O(n) where n is number of nodes in linked list.Auxiliary Space: O(1)Please refer complete article on Delete N nodes after M nodes of a linked list for more details! Comment More infoAdvertise with us Next Article Javascript Program To Delete N Nodes After M Nodes Of A Linked List kartik Follow Improve Article Tags : Linked List JavaScript Web Technologies DSA Linked Lists Microsoft Amazon +3 More Practice Tags : AmazonMicrosoftLinked List Similar Reads JavaScript Linked List Programs JavaScript Linked List Programs contain a list of articles based on programming. Linked List is a linear data structure that stores data in linearly connected nodes. Linked lists store elements sequentially, but doesnât store the elements contiguously like an array. S. NoArticles1JavaScript Program 5 min read Implementation of LinkedList in Javascript In this article, we will be implementing the LinkedList data structure in Javascript.A linked list is a linear data structure where elements are stored in nodes, each containing a value and a reference (or pointer) to the next node. It allows for efficient insertion and deletion operations.Each node 5 min read Javascript Program For Searching An Element In A Linked List Write a function that searches a given key 'x' in a given singly linked list. The function should return true if x is present in linked list and false otherwise.bool search(Node *head, int x) For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then functio 3 min read Javascript Program For Inserting A Node In A Linked List We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.All programs discussed in this post consider the following representations of the linked list. JavaScript// Linked List Class // Head of list let head; // Node 7 min read Javascript Program For Inserting Node In The Middle Of The Linked List Given a linked list containing n nodes. The problem is to insert a new node with data x at the middle of the list. If n is even, then insert the new node after the (n/2)th node, else insert the new node after the (n+1)/2th node.Examples: Input : list: 1->2->4->5 x = 3Output : 1->2->3- 4 min read Javascript Program For Writing A Function To Delete A Linked List A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. This article focuses on writing a function to delete a linked list.Implementation: JavaScript// Javascript program to delete // a li 1 min read Javascript Program For Deleting A Linked List Node At A Given Position Given a singly linked list and a position, delete a linked list node at the given position.Example: Input: position = 1, Linked List = 8->2->3->1->7Output: Linked List = 8->3->1->7Input: position = 0, Linked List = 8->2->3->1->7Output: Linked List = 2->3->1- 3 min read Javascript Program For Finding Length Of A Linked List Write a function to count the number of nodes in a given singly linked list.For example, the function should return 5 for linked list 1->3->1->2->1.Iterative Solution: 1) Initialize count as 0 2) Initialize a node pointer, current = head.3) Do following while current is not NULL a) curre 3 min read Javascript Program For Rotating A Linked List Given a singly linked list, rotate the linked list counter-clockwise by k nodes. Where k is a given positive integer. For example, if the given linked list is 10->20->30->40->50->60 and k is 4, the list should be modified to 50->60->10->20->30->40. Assume that k is smal 5 min read Javascript Program For Making Middle Node Head In A Linked List Given a singly linked list, find middle of the linked list and set middle node of the linked list at beginning of the linked list. Examples:Input: 1 2 3 4 5 Output: 3 1 2 4 5Input: 1 2 3 4 5 6Output: 4 1 2 3 5 6 The idea is to first find middle of a linked list using two pointers, first one moves on 3 min read Like