Given a string, the task is to remove duplicates from it. Expected time complexity O(n) where n is length of input string and extra space O(1) under the assumption that there are total 256 possible characters in a string.
Note: that original order of characters must be kept same.
First line of the input is the number of test cases T. And first line of test case contains a string.
Modified string without duplicates and same order of characters.
1 <= T <= 15
1 <= |string|<= 1000
geeks for geeks
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.