
Given a string s, return the length of the longest substring with no repeated characters. A substring must be contiguous.
s = "abcabcbb"Output3WhyThe longest valid substring is `"abc"`.s = "bbbbb"Output1WhyOnly one unique character can appear in any valid substring.`0 <= len(s) <= 5 * 10^4``s` consists of letters, digits, symbols, and spacesAim for linear time