Longest Substring Without Repeating CharactersMediumAcceptance Rate 33.8%Given a string s, find the length of the longest substring without repeating characters.ExamplesExample 1Inputs = "abcabcbb"Output3ExplanationThe answer is "abc", with the length of 3.Constraints0 <= s.length <= 5 * 10^4s consists of English letters, digits, symbols and spaces.