Skip to content

Practice Longest Substring Without Repeating Characters

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3
LeetCode Problem

Longest Substring Without Repeating Characters

Problem Statement

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

Source: Longest Substring Without Repeating Characters on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "abcabcbb"
Output
3

# Example 2

Input
s = "bbbbb"
Output
1

# Example 3

Input
s = "pwwkew"
Output
3

Constraints

0 <= s.length <= 10^5
s consists of English letters, digits, symbols and spaces.

Related LeetCode Problems

Practice more problems similar to Longest Substring Without Repeating Characters.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.