Delete N nodes after M nodes of a linked list
Last Updated :
11 Dec, 2024
Given a linked list and two integers m and n, the task is to traverse the linked list such that you skip m nodes, then delete the next n nodes, and continue the same till end of the linked list.
Note: m cannot be 0.
Example:
Input: Linked List: 9->1->3->5->9->4->10->1, n = 1, m = 2
Output: 9->1->5->9->10->1
Explanation: Deleting 1 node after skipping 2 nodes each time, we have list as 9-> 1-> 5-> 9-> 10-> 1.
Input: Linked List: 1->2->3->4->5->6, n = 1, m = 6
Output: 1->2->3->4->5->6
Explanation: After skipping 6 nodes for the first time , we will reach of end of the linked list, so, we will get the given linked list itself.
The idea is to go through a linked list and, for every set of nodes, keep the first m nodes and delete the next n nodes, and then repeat this process until the end of the list.
Step-by-step approach:
- Start with a pointer at the first node (the head) of the linked list.
- Move this pointer forward m times, so it skips over m nodes.
- After skipping m nodes, the next n nodes should be deleted.
- To do this, we disconnect these n nodes from the list and free their memory.
- After deleting the n nodes, repeat the process starting from the next node. Skip the next m nodes and delete the following n nodes.
- This process will stops when we reach to end of the list, either because there are fewer than m nodes left to skip or there are no nodes left to delete.
Below is the implementation of the above approach:
C++
// C++ program to delete n nodes
// after m nodes of a linked list
#include <bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *next;
Node(int x){
data = x;
next = nullptr;
}
};
// Function to skip m nodes and then
// delete n nodes of the linked list.
Node* skipMdeleteN(Node *head, int m, int n) {
Node *curr = head, *t;
// The main loop that traverses
// through the whole list
while (curr != nullptr) {
// Skip m nodes
for (int i = 1; i < m && curr!= nullptr; i++)
curr = curr->next;
// If we reached end of list, then return
if (curr == nullptr)
return head;
// Start from next node and delete n nodes
t = curr->next;
for (int i = 1; i <= n && t!= nullptr; i++) {
Node *temp = t;
t = t->next;
delete(temp);
}
// Link the previous list with
// remaining nodes
curr->next = t;
// Set current pointer for next iteration
curr = t;
}
return head;
}
void printList(Node *head) {
Node *curr = head;
while (curr != nullptr) {
cout<<curr->data<<" ";
curr = curr->next;
}
cout<<endl;
}
int main() {
// Create following linked list:
// 1->2->3->4->5->6
Node* head = new Node(1);
head->next = new Node(2);
head->next->next = new Node(3);
head->next->next->next = new Node(4);
head->next->next->next->next = new Node(5);
head->next->next->next->next->next = new Node(6);
int m = 2, n = 2;
head = skipMdeleteN(head, m, n);
printList(head);
return 0;
}
// C program to delete n nodes after
// m nodes of a linked list
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int data;
struct Node *next;
};
// Function to skip m nodes and then delete n nodes of the linked list
struct Node *skipMdeleteN(struct Node *head, int m, int n){
struct Node *curr = head; // Current node pointer
struct Node *t; // Temporary node pointer
int count; // Counter variable
// Traverse through the entire linked list
while (curr != NULL){
// Skip m nodes
for (count = 1; count < m && curr != NULL; count++)
curr = curr->next;
// If end of the list is reached, return the head
if (curr == NULL)
return head;
// Start from the next node and delete n nodes
t = curr->next;
for (count = 1; count <= n && t != NULL; count++){
struct Node *temp = t;
t = t->next;
free(temp);
}
// Link the current node to the remaining list
curr->next = t;
// Move the current pointer to the next node
curr = t;
}
return head;
}
void printList(struct Node *head){
struct Node *curr = head;
while (curr != NULL){
printf("%d ", curr->data);
curr = curr->next;
}
printf("\n");
}
struct Node *createNode(int data){
struct Node *temp = (struct Node *)malloc(sizeof(struct Node));
temp->data = data;
temp->next = NULL;
return temp;
}
int main(){
// Create the following linked list: 1->2->3->4->5->6
struct Node *head = createNode(1);
head->next = createNode(2);
head->next->next = createNode(3);
head->next->next->next = createNode(4);
head->next->next->next->next = createNode(5);
head->next->next->next->next->next = createNode(6);
int m = 2, n = 2;
head = skipMdeleteN(head, m, n);
printList(head);
return 0;
}
// Java program to delete n nodes
// after m nodes of a linked list
class Node {
int data;
Node next;
Node(int data)
{
this.data = data;
this.next = null;
}
}
class GfG {
// Function to skip m nodes and then delete n nodes
// of the linked list
static Node skipMdeleteN(Node head, int m, int n)
{
Node curr = head; // Current node pointer
Node t; // Temporary node pointer
int count; // Counter variable
// Traverse through the entire linked list
while (curr != null) {
// Skip m nodes
for (count = 1; count < m && curr != null;
count++)
curr = curr.next;
// If end of the list is reached, return the
// head
if (curr == null)
return head;
// Start from the next node and delete n nodes
t = curr.next;
for (count = 1; count <= n && t != null;
count++) {
Node temp = t;
t = t.next;
// Dereference the node for garbage
// collection
temp = null;
}
// Link the current node to the remaining list
curr.next = t;
// Move the current pointer to the next node
curr = t;
}
return head;
}
static void printList(Node head)
{
Node curr = head;
while (curr != null) {
System.out.print(curr.data + " ");
curr = curr.next;
}
System.out.println();
}
public static void main(String[] args)
{
// Create the following linked list:
// 1->2->3->4->5->6
Node head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
head.next.next.next.next = new Node(5);
head.next.next.next.next.next = new Node(6);
int m = 2, n = 2;
head = skipMdeleteN(head, m, n);
printList(head);
}
}
# Python program to delete n nodes
# after m nodes of a linked list
class Node:
def __init__(self, data):
self.data = data
self.next = None
# Function to skip m nodes and then delete n nodes
# of the linked list
def skipMdeleteN(head, m, n):
curr = head # Current node pointer
count = 0 # Counter variable
# Traverse through the entire linked list
while curr:
# Skip m nodes
for count in range(1, m):
if curr is None:
return head
curr = curr.next
# If end of the list is reached, return the head
if curr is None:
return head
# Start from the next node and delete n nodes
t = curr.next
for count in range(1, n + 1):
if t is None:
break
temp = t
t = t.next
del temp # Delete the node
# Link the current node to the remaining list
curr.next = t
# Move the current pointer to the next node
curr = t
return head
def printList(head):
curr = head
while curr:
print(curr.data, end=" ")
curr = curr.next
print()
if __name__ == "__main__":
# Create the following linked list: 1->2->3->4->5->6
head = Node(1)
head.next = Node(2)
head.next.next = Node(3)
head.next.next.next = Node(4)
head.next.next.next.next = Node(5)
head.next.next.next.next.next = Node(6)
m = 2
n = 2
head = skipMdeleteN(head, m, n)
printList(head)
using System;
class Node {
public int data;
public Node next;
public Node(int data)
{
this.data = data;
this.next = null;
}
}
class GfG {
// Function to skip m nodes and then delete n nodes of
// the linked list
public static Node skipMdeleteN(Node head, int m, int n)
{
Node curr = head; // Current node pointer
Node t; // Temporary node pointer
int count; // Counter variable
// Traverse through the entire linked list
while (curr != null) {
// Skip m nodes
for (count = 1; count < m && curr != null;
count++)
curr = curr.next;
// If end of the list is reached, return the
// head
if (curr == null)
return head;
// Start from the next node and delete n nodes
t = curr.next;
for (count = 1; count <= n && t != null;
count++) {
t = t.next; // Move to the next node
}
// Link the current node to the remaining list
curr.next = t;
// Move the current pointer to the next node
curr = t;
}
return head;
}
static void printList(Node head)
{
Node curr = head;
while (curr != null) {
Console.Write(curr.data + " ");
curr = curr.next;
}
Console.WriteLine();
}
static void Main()
{
// Create the following linked list:
// 1->2->3->4->5->6
Node head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
head.next.next.next.next = new Node(5);
head.next.next.next.next.next = new Node(6);
int m = 2, n = 2;
head = skipMdeleteN(head, m, n);
printList(head);
}
}
// Javascript program to delete n nodes
// after m nodes of a linked list
class Node {
constructor(data)
{
this.data = data;
this.next = null;
}
}
// Function to skip m nodes and then delete n nodes of the
// linked list
function skipMdeleteN(head, m, n)
{
let curr = head; // Current node pointer
let count = 0; // Counter variable
// Traverse through the entire linked list
while (curr !== null) {
// Skip m nodes
for (count = 1; count < m && curr !== null; count++)
curr = curr.next;
// If end of the list is reached, return the head
if (curr === null)
return head;
// Start from the next node and delete n nodes
let t = curr.next;
for (count = 1; count <= n && t !== null; count++) {
let temp = t;
t = t.next;
// Dereference the node
temp = null;
}
// Link the current node to the remaining list
curr.next = t;
// Move the current pointer to the next node
curr = t;
}
return head;
}
function printList(head)
{
let curr = head;
while (curr !== null) {
process.stdout.write(curr.data + " ");
curr = curr.next;
}
console.log();
}
// Create the following linked list: 1->2->3->4->5->6
let head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);
head.next.next.next = new Node(4);
head.next.next.next.next = new Node(5);
head.next.next.next.next.next = new Node(6);
let m = 2, n = 2;
// Perform the skip and delete operation
head = skipMdeleteN(head, m, n);
// Print the modified linked list
printList(head);
Time Complexity: O(n), where n is the total number of nodes in the linked list. This is because the algorithm processes each node exactly once, either by skipping it or by deleting it.
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem