// Given a string, find the length of the longest substring without repeating characters. // Explanation: The answer is "wke", with the length of 3. // Note that the answer must be a substring, "pwke" ...