Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

Given a string s, return the length of the longest substring with no repeating characters. This is the canonical sliding window problem: expand the window's right edge, and when a duplicate appears, shrink the left edge past the previous occurrence.

lengthOfLongestSubstring("abcabcbb"); // 3  ("abc")
lengthOfLongestSubstring("bbbbb");    // 1  ("b")
lengthOfLongestSubstring("pwwkew");   // 3  ("wke")