Recursively remove all adjacent duplicates | Practice | GeeksforGeeks

Share Our Content With ⤦

Share on facebook
Share on twitter
Share on linkedin
Share on google
Share on whatsapp
Share on telegram
Share on reddit
Share on pinterest
Share on print


Given a string s, recursively remove adjacent duplicate characters from the string s. The output string should not have any adjacent duplicates.

 

Input:

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.

Output:

For each test case, print a new line containing the resulting string.

Constraints:

1<=T<=100

1<=Length of string<=50

Example:
Input:

2

geeksforgeek
acaaabbbacdddd

Output:

gksforgk

acac





Source link

Share on facebook
Facebook
Share on twitter
Twitter
Share on linkedin
LinkedIn
Share on pinterest
Pinterest
Share on reddit
Reddit
Share on telegram
Telegram
Share on email
Email

Leave a Reply

Your email address will not be published. Required fields are marked *