Longest Substring Without Repeating Characters
Given a string `s`, find the length of the longest substring without repeating characters.
Problem Description
Example 1:
Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1.
Constraints:
0 <= s.length <= 5 * 104sconsists of English letters, digits, symbols and spaces.
Solution
Write your code here. (Editor is for demonstration)
function lengthOfLongestSubstring(s) {
// Write your code here
};