Journal Archive

2022

var lengthOfLongestSubstring = function(s) {
    let start = 0;
    let end = 0;
    let maxLength = 0;
    
    if (s === "") return 0;
    if (s.length === 1) return 1;
    
    let substring = new Set();
    
    for (end; end < s.length;) {
        if (!substring.has(s[end])) {
            substring.add(s[end]);
            maxLength = Math.max(maxLength, substring.size);
            end++;
        } else {
            substring.delete(s[start]);
            start++;
            
        }
    }
    return maxLength;
};

Day 15: Solving one of LeetCode problems

3. Longest Substring Without Repeating Characters Difficulty - Medium

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

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.

Example 3:

Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Constraints:

  • 0 <= s.length <= 5 * 104
  • s consists of English letters, digits, symbols and spaces.