Please enter your email address or userHandle.
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".
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.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.