3. Longest Substring Without Repeating Characters

https://leetcode.com/problems/longest-substring-without-repeating-characters

Python

Test Cases

• "abcabcbb"
• " "
• "ok"
• "dvdf"

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        length = len(s)
        if length < 2:
            return length

        longest_length = 0
        left, right = 0, 0

        while right < length:
            if s[right] in s[left:right]:
                longest_length = max(longest_length, right-left)
                left += 1
                right = left
                continue
            right += 1

        return max(longest_length, right-left)