# Remove every k-th node of the linked list

Given a singly linked list, Your task is to remove every K-th node of the linked list. Assume that K is always less than or equal to length of Linked List.

**Examples :**

Input : 1->2->3->4->5->6->7->8 k = 3 Output : 1->2->4->5->7->8 As 3 is the k-th node after its deletion list would be 1->2->4->5->6->7->8 And now 4 is the starting node then from it, 6 would be the k-th node. So no other kth node could be there.So, final list is: 1->2->4->5->7->8. Input: 1->2->3->4->5->6 k = 1 Output: Empty list All nodes need to be deleted

The idea is traverse the list from beginning and keep track of nodes visited after last deletion. Whenever count becomes k, delete current node and reset count as 0.

(1) Traverse list and do following (a) Count node before deletion. (b) If (count == k) that means current node is to be deleted. (i) Delete current node i.e. do // assign address of next node of // current node to the previous node // of the current node. prev->next = ptr->next i.e. (ii) Reset count as 0, i.e., do count = 0. (c) Update prev node if count != 0 and if count is 0 that means that node is a starting point. (d) Update ptr and continue until all k-th node gets deleted.

Below is C++ implementation.

`// C++ program to delete every k-th Node of ` `// a singly linked list. ` `#include<iostream> ` `using` `namespace` `std; ` ` ` `/* Linked list Node */` `struct` `Node ` `{ ` ` ` `int` `data; ` ` ` `struct` `Node* next; ` `}; ` ` ` `// To remove complete list (Needed for ` `// case when k is 1) ` `void` `freeList(Node *node) ` `{ ` ` ` `while` `(node != NULL) ` ` ` `{ ` ` ` `Node *next = node->next; ` ` ` `delete` `(node); ` ` ` `node = next; ` ` ` `} ` `} ` ` ` `// Deletes every k-th node and returns head ` `// of modified list. ` `Node *deleteKthNode(` `struct` `Node *head, ` `int` `k) ` `{ ` ` ` `// If linked list is empty ` ` ` `if` `(head == NULL) ` ` ` `return` `NULL; ` ` ` ` ` `if` `(k == 1) ` ` ` `{ ` ` ` `freeList(head); ` ` ` `return` `NULL; ` ` ` `} ` ` ` ` ` `// Initialize ptr and prev before starting ` ` ` `// traversal. ` ` ` `struct` `Node *ptr = head, *prev = NULL; ` ` ` ` ` `// Traverse list and delete every k-th node ` ` ` `int` `count = 0; ` ` ` `while` `(ptr != NULL) ` ` ` `{ ` ` ` `// increment Node count ` ` ` `count++; ` ` ` ` ` `// check if count is equal to k ` ` ` `// if yes, then delete current Node ` ` ` `if` `(k == count) ` ` ` `{ ` ` ` `// put the next of current Node in ` ` ` `// the next of previous Node ` ` ` `delete` `(prev->next); ` ` ` `prev->next = ptr->next; ` ` ` ` ` `// set count = 0 to reach further ` ` ` `// k-th Node ` ` ` `count = 0; ` ` ` `} ` ` ` ` ` `// update prev if count is not 0 ` ` ` `if` `(count != 0) ` ` ` `prev = ptr; ` ` ` ` ` `ptr = prev->next; ` ` ` `} ` ` ` ` ` `return` `head; ` `} ` ` ` `/* Function to print linked list */` `void` `displayList(` `struct` `Node *head) ` `{ ` ` ` `struct` `Node *temp = head; ` ` ` `while` `(temp != NULL) ` ` ` `{ ` ` ` `cout<<temp->data<<` `" "` `; ` ` ` `temp = temp->next; ` ` ` `} ` `} ` ` ` `// Utility function to create a new node. ` `struct` `Node *newNode(` `int` `x) ` `{ ` ` ` `Node *temp = ` `new` `Node; ` ` ` `temp->data = x; ` ` ` `temp->next = NULL; ` ` ` `return` `temp; ` `} ` ` ` `/* Driver program to test count function*/` `int` `main() ` `{ ` ` ` `/* Start with the empty list */` ` ` `struct` `Node* head = newNode(1); ` ` ` `head->next = newNode(2); ` ` ` `head->next->next = newNode(3); ` ` ` `head->next->next->next = newNode(4); ` ` ` `head->next->next->next->next = newNode(5); ` ` ` `head->next->next->next->next->next = newNode(6); ` ` ` `head->next->next->next->next->next->next = ` ` ` `newNode(7); ` ` ` `head->next->next->next->next->next->next->next = ` ` ` `newNode(8); ` ` ` ` ` `int` `k = 3; ` ` ` `head = deleteKthNode(head, k); ` ` ` ` ` `displayList(head); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

1 2 4 5 7 8

Time Complexity : O(n)

This article is contributed by **Sahil Chhabra**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Remove last node of the linked list
- Remove Nth node from end of the Linked List
- Remove first node of the linked list
- Create new linked list from two given linked list with greater element at each node
- Swap Kth node from beginning with Kth node from end in a Linked List
- Squareroot(n)-th node in a Linked List
- Linked List | Set 2 (Inserting a node)
- Linked List | Set 3 (Deleting a node)
- Delete Nth node from the end of the given linked list
- Program for n'th node from the end of a Linked List
- Detect and Remove Loop in a Linked List
- Remove duplicates from an unsorted linked list
- Remove duplicates from a sorted linked list
- Delete every Kth node from circular linked list
- Delete a node in a Doubly Linked List