855. Longest Good Substring
0
Medium
Given a string s, the task is to find the length of the longest substring that contains all distinct characters. This substring is considered Good.
Input Format
The input consists of a string containing English letters, digits, and symbols.
Output Format
Print the length of the longest good substring in a new line for each test case.
Example
Input
abcabcbb
Output
3
Constraints
0 <= s.length <= 105
Loading...
View Submissions
Console