Medium

• Strings
• Sliding Window
• Hash Map

Given a string s, find the length of the longest substring without repeating characters.

• A string s consisting of English letters, digits, symbols, and spaces.
• 1 <= s.length <= 10^4

• An integer representing the length of the longest substring without repeating characters.

• Input: "abcabcbb"
• Output: 3
• Explanation: The answer is "abc", with the length of 3.

• Input: "bbbbb"
• Output: 1
• Explanation: The answer is "b", with the length of 1.

• Input: "pwwkew"
• Output: 3
• Explanation: The answer is "wke", with the length of 3.

console.log(lengthOfLongestSubstring("abcabcbb")); // 3
console.log(lengthOfLongestSubstring("bbbbb")); // 1
console.log(lengthOfLongestSubstring("pwwkew")); // 3
console.log(lengthOfLongestSubstring("")); // 0