Longest Substring Without Repeating Characters

1Medium

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.

Constraints:

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

Jnaneshwara Reddy Satti

Builder · ClearCode

Hi — I'm a 21yo CS grad from India. I built ClearCode while recovering from a surgery, because I genuinely believe DSA should be visual, free, and accessible to everyone. No VC funding. No team. Just me, my laptop, and a lot of chai. ☕

If ClearCode helped you understand even one concept — consider supporting it. Every rupee keeps the servers running and new videos coming.

Support via Razorpay

Found this helpful? Support ClearCode ☕ — keeps it free forever

Algorithm Visualizer

Welcome

TEST CASE: []

clearcode.in

Execution Trace

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

3### Example 1:

4Input: s = "abcabcbb"

5Output: 3

6Explanation: The answer is "abc", with the length of 3.

8### Example 2:

9Input: s = "bbbbb"

10Output: 1

11Explanation: The answer is "b", with the length of 1.

13### Example 3:

14Input: s = "pwwkew"

15Output: 3

16Explanation: The answer is "wke", with the length of 3.

17Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

19### Constraints:

20- 0 <= s.length <= 5 * 10^4

21- s consists of English letters, digits, symbols and spaces.

0:00 / 14:37

Longest Substring Without Repeating Characters — Medium Sliding Window Algorithm | ClearCode