Longest Substring Without Repeating Characters

Given a string s, return the length of the longest substring that contains no repeated characters.

Example

Input: s = "abcabcbb"
Output: 3        // "abc"