Tap here to switch tabs
Problem
Submissions

Problem: Longest Substring without Repeating Characters

Longest Substring without Repeating Characters asks you to return the length of the longest contiguous part of a string in which every character appears only once.

Statement

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

Constraints:

  • 11 ≤\leq input_str.length ≤105\leq 10^5
  • input_str consists of English letters, digits, and spaces.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Longest Substring without Repeating Characters

Longest Substring without Repeating Characters asks you to return the length of the longest contiguous part of a string in which every character appears only once.

Statement

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

Constraints:

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