Algorithm Question Demo

Question

Longest Substring Without Repeating Characters

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

Example

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

Answer

def length_of_longest_substring(s: str) -> int:
    pass