Longest Substring Without Repeating - Read Statement

Given a string s, find the length of the longest substring without repeating characters.

Example: For "abcabcbb", the answer is $3$ ("abc"). For "bbbbb", the answer is $1$.