Given a singly linked list, your task is to remove every kth node from the linked list.
The first line of input contains number of test cases T. Then T test cases follow. Every test case contains 3 lines. First line of every test case contains an integer N denoting the size of the linked list . The second line contains N space separated values of the linked list. The third line contains an integer K.
Output for each test case will be space separated values of the nodes of the new transformed linked list.
The task is to complete the function deleteK() which should delete every kth nodes from the linked list.
1 <= T <= 50
1 <= N <= 100
1 <= element of linked list <= 1000
0 <= k <= 100
1 2 3 4 5 6 7 8
1 2 3 4
1 2 4 5 7 8
Testcase 1: After removing every 3rd element from the linked list, we have updated list as 1, 2, 4, 5, 7 and 8, and the elements which are removed are 3 and 6.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.