Back to DSA sheet

Longest Substring Without Repeating Characters

MediumSliding Window
Open on LeetCodeAmazonGoogleMeta

Return the length of the longest substring that contains no repeating characters.

Constraints
  • 0 <= s.length <= 5 * 10^4
  • s consists of English letters, digits, symbols and spaces
Sheets
Blind 75Grind 75NeetCode 150NeetCode 250
longest-substring-without-repeating-characters.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.