New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Delete Nodes On Regular Intervals

Contributed by

Prashant Thakur

Last Updated: 23 Feb, 2023

Ninja

0/200

Avg time to solve 20 mins

Success Rate 67 %

0 upvotes

Problem Statement

You are given two integers, ‘A’ and ‘B’, and the ‘head’ of a linked list. You are also given ‘N’, denoting the number of nodes in the linked list. You have to return the head of the modified, linked list by removing the nodes in the following way:

Start with the head as the current node.
Starting with the current node, keep the first ‘A’ nodes.
Remove the next ‘B’ nodes.
Repeat steps 2 and 3 until we have reached the end of the node.

Example:

Input: ‘A’ = 2, ‘B’ = 2, ‘N’ = 8, ‘head’ = [1, 2, 3, 4, 5, 6, 7, 8]

Output: [1, 2, 5, 6]

Explanation: Keep the first A(2) nodes, delete the next B(2) nodes, and continue until we have reached the end of the linked list.

Detailed explanation ( Input/output format, Notes, Images )

Input Format

First-line contains 'T', denoting the number of Test cases.

For each Test case:

The first line contains two integers, ‘A’ and ‘B’, denoting the number of nodes to keep and the number of nodes to delete.

The second line contains one integer, ‘N’, denoting the number of nodes in the linked list.

The third line contains N integers denoting the number of nodes in the linked list.

Output format:

Return the head of the linked list after modifying the linked list as said above.

Note:-

You don't need to print anything. Just implement the given function.

Constraints:

1 <= T <= 10
1 <= N <= 1e3
1 <= A, B <= 100
The value of each node in the linked list is in the range [1 to 1e9]

Time Limit: 1-sec

Sample Input 1:

2
2 2
8
1 2 3 4 5 6 7 8

2 3
4
10 20 30 40

Sample Output 1:

1 2 5 6
10 20

Explanation Of Sample Input 1:

For test case 1:

Input: ‘A’ = 2, ‘B’ = 2, ‘N’ = 8, ‘head’ = [1, 2, 3, 4, 5, 6, 7, 8]

Output: [1, 2, 5, 6]

Explanation: Keep the first A(2) nodes, delete the next B(2) nodes, and continue until we have reached the end of the linked list.

For test case 2:

Input: ‘A’ = 2, ‘B’ = 2, ‘N’ = 8, ‘head’ = [1, 2, 3, 4, 5, 6, 7, 8]

Output: [1, 2, 5, 6]

Explanation: Keep the first A(2) nodes, delete the next B(3) nodes, and continue until we have reached the end of the linked list.

Sample Input 2:

Sample Output 2:

8
9 7

Auto

Console