Leetcode 15 Three Sum

3. Longest Substring Without Repeating Characters #

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