Longest Substring Without Repeating Characters

Given a string s, the task is to find the length of the longest substring without any repeating characters. In other words, if T is a substring of s in which all characters are distinct, you need to compute

\( \max |T| \)

For example, when s is abcabcbb, the answer is 3 because the longest substring with unique characters is abc.

inputFormat

The input consists of a single line containing the string s. The string may include spaces, special characters, or even be empty.

outputFormat

Output a single integer representing the length of the longest substring of s that does not include any repeating characters.

abcabcbb

3