Find the length of the longest contiguous substring in s that contains no repeated characters. Return an integer length, not the substring itself.
s = "abcabcbb"Output3Why"abc" is the longest valid substring.s = "bbbbb"Output1WhyOnly one distinct character can be kept in the window.`0 <= len(s) <= 10^5``s` may contain letters, digits, spaces, and symbolsTarget solution should run in linear time