Please enter your email address or userHandle.
Given a string S, find length of the longest substring with all distinct characters. For example, for input "abca", the output is 3 as "abc" is the longest substring with all distinct characters.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is String str.
Print length of smallest substring with maximum number of distinct characters.
Note: The output substring should have all distinct characters.
1 ≤ T ≤ 100
1 ≤ size of str ≤ 10000
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.