Longest Substring Without Repeating Characters

Given a string s, return the length of its longest contiguous substring that contains no repeated characters.

Example 1:

Input: s = "abcabcbb"
Output: 3
Explanation: The longest substri...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: