Please enter your email address or userHandle.
Given a string s, recursively remove adjacent duplicate characters from the string s. The output string should not have any adjacent duplicates.
The first line of input contains an integer T, denoting the no of test cases. Then T test cases follow. Each test case contains a string str.
For each test case, print a new line containing the resulting string.
1<=Length of string<=50
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.