3-LongestSubstringWithoutRepeatingCharacters

Longest Substring Without Repeating Characters

Problem can be found in here!

Solution

def lengthOfLongestSubstring(s: str) -> int:
    memo = set()
    window_start = window_end = max_length = 0

    while window_start < len(s) and window_end < len(s):
        token = s[window_end]
        if token in memo:
            memo.remove(s[window_start])
            window_start += 1
        else:
            window_end += 1
            max_length = max(max_length, window_end-window_start)
            memo.add(token)

    return max_length

Time Complexity: , Space Complexity: