462. Longest Good Substring
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.
The input consists of a string containing English letters, digits, and symbols.
Print the length of the longest good substring in a new line for each test case.
0 <= s.length <= 105