Given a string of both uppercase and lowercase alphabets, the task is to print the string with alternate occurrences of any character dropped(including space and consider upper and lowercase as same).
First line consists of T test cases. First line of every test case consists of String S.
Single line output, print the updated string.
It is a long day dear.
Geeks for geeks
It sa longdy ear.
For the 1st test case.
Print first "I" and then ignore next "i". Similarly print first space then ignore next space. and so on.
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.