Given a string containing lower and uppercase alphabets, the task is to find the maximum number of characters between any two same character in the string.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a string S.
For each test case, print the maximum number in new line. If no character repeats, print "-1".
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.