Longest Substring Without Repeat
Given a string,
find the length of the longest substring without repeating characters.
Example:
The longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3.
For "bbbbb" the longest substring is "b", with the length of 1.
Hints
- Solution Approach
- Complete Solution
5282 successful submissions.
Asked In:
- Amazon