bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
MediumSliding WindowLC 3

Longest Substring Without Repeating Characters

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

Asked at 33 companies
AdobeAlationAlibaba
Hints
  • 1.Think about what data structure fits Longest Substring Without Repeating Characters
  • 2.Consider the brute force complexity and how to optimize
  • 3.Can you trade space for time?
LeetCodeNeetCode