Problem 58003. Given a string s, find the length of the longest substring without repeating characters.
Given a string s, find the length of the longest substring without repeating characters.
Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
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.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers11
Suggested Problems
-
1523 Solvers
-
Create logical matrix with a specific row and column sums
298 Solvers
-
Determine if input is a Narcissistic number
188 Solvers
-
How long do each of the stages of the rocket take to burn?
259 Solvers
-
Count letters occurence in text, specific to words with a given length.
151 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!