mediumSliding Window Pattern

Longest Substring Without Repeating Characters

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

Examples

Input:s = "abcabcbb"
Output:3

Explanation: The answer is "abc", with length 3.

Input:s = "bbbbb"
Output:1

Explanation: The answer is "b", with length 1.

Hints (0/3)

Try to solve it first! Click "Reveal Next Hint" if you get stuck.

Your Code:
Results:
Output

Click "Run" to execute your code