Problem : Beautiful Substring
A string is said to be "Beautiful", if it contains only non repetitive alphabets. Let S be the string with lower case alphabets, your task is to find out the longest "Beautiful sub-string" present in the given string S.
First line starts with T, which is the number of test cases. Each test case contains string S.
Print the first longest beautiful sub string present in the string S.
1<=|S|<=5500, S will contain only lower case alphabets.
Sample Input and Output
SNo. Input Output
Please do not use package and namespace in your code. For object oriented languages your code should be written in one class.
Participants submitting solutions in C language should not use functions from <conio.h> / <process.h> as these files do not exist in gcc