3. Longest Substring Without Repeating Characters
Medium38.5% acceptance9,053,871 / 23,494,055 submissions
Asked by 112 companies
Topics
Given a string s, find the length of the longest substring without duplicate characters.
Example 1:
Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Note that"bca"and"cab"are also correct answers.
Example 2:
Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1.
Example 3:
Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
Constraints:
0 <= s.length <= 5 * 104sconsists of English letters, digits, symbols and spaces.
Hints
Hint 1
Generate all possible substrings & check for each substring if it's valid and keep updating maxLen accordingly.
Similar Questions
Longest Substring with At Most Two Distinct CharactersMediumLongest Substring with At Most K Distinct CharactersMediumSubarrays with K Different IntegersHardMaximum Erasure ValueMediumNumber of Equal Count SubstringsMediumMinimum Consecutive Cards to Pick UpMediumLongest Nice SubarrayMediumOptimal Partition of StringMediumCount Complete Subarrays in an ArrayMediumFind Longest Special Substring That Occurs Thrice IIMediumFind Longest Special Substring That Occurs Thrice IMedium