Cody

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

  • Created by C B
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.
Solve

Solution Stats

50.0% Correct | 50.0% Incorrect
Last Solution submitted on Nov 25, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers8

Suggested Problems

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!