Problem title
Difficulty
Avg time to solve

K Max Sum Combinations
Easy
10 mins
Maximum In Sliding Windows Of Size K
Moderate
20 mins
Generate Binary Numbers
Easy
10 mins
K subsets with equal sum
Easy
15 mins
Combination Sum
Easy
15 mins
Linear Probing
Easy
15 mins
Number of rectangles in a grid
Easy
15 mins
Closest Leaf To Given Node In Binary Tree
Moderate
15 mins
Max Stack
Easy
15 mins
Count triplets in a sorted doubly linked list whose sum is equal to a given value x
Moderate
15 mins
10

Remove String

Difficulty: MEDIUM
Contributed By
Avg. time to solve
35 min
Success Rate
60%

Problem Statement

You have to remove all the occurrences of string STR from the linked list.

Note:
``````1. Start checking from the end of the linked list and not from the beginning. For example, if the linked list is ( a, b, a ,b, a)  and the string is equal to “aba” , then the answer should be (a b), not (b a).

2. After removing an occurrence check again for new formations.
``````
Input format:
``````The first line contains an Integer 'T' which denotes the number of test cases.

The first line of each test case contains the elements of the singly linked list which are the characters not separated by a space.

The second line of each test case contains the string named 'STR'.
``````
Output format:
``````For each test case, return the head of the linked list with updated character nodes after removing occurrences of the string.
``````
Note:
``````You don't need to print the output, it has already been taken care of. Just implement the given function.
``````
Constraints:
``````1 <= T <= 10
0 <= N <= 10^3
0 <= K <= 10^2

Where 'N' is the size of the singly linked list and 'K' is the size of the string.

Time limit: 1 sec
``````
Sample Input 1 :
``````2
abcbcaab
bca
ny
nytq
``````
Sample Output 1 :
``````a b
n y
``````
Explanation of The Sample Output 1:
``````In test case 1, after 1st removal of the string from the linked list: abcbcaab -> abcab. Now again, after 2nd removal of the string from the linked list: abcab -> ab. Thus ab is the updated linked list.

In test case 2, no occurrence of the string is present in the linked list, thus the linked list will be unchanged.
``````
Sample Input 2 :
``````1
qcacca
cac
xxxxxxxxxxxxxx
xxx
``````
Sample Output 2 :
``````q c a
x x
``````
Explanation of The Sample Output 2 :
``````In test case 1, after the 1st removal of the string from the linked list: qcacca  ->  qca. Thus qca is the updated linked list.

In test case 2, as we can see there are total 4 occurrences of xxx, and by removing each occurrence: xxxxxxxxxxxxxx -> xxxxxxxxxxx -> xxxxxxxx -> xxxxx -> xx. Thus no more occurrence of the string is possible and hence the updated linked list will be xx.
``````
Console