Longest Substring without Repeating Characters

Try to solve the Longest Substring without Repeating Characters problem.

We'll cover the following

Statement

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

Constraints:

  • 11 ≤\leq str.length ≤105\leq 10^5
  • str consists of English letters, digits, and spaces.

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy