Solo practice workspace

Interview Coder drill

Longest Substring Without Repeating Characters

20:00

Medium

Given a string, find the length of the longest substring with no repeated characters. Print the length.

Example 1

Input: s = "abcabcbb"

Output: 3

abc is the longest substring without repeats.

Constraints

0 <= s.length <= 5 * 10^4s may contain spaces, symbols, and letters

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Sliding Window pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...