SK

Shyam Kunwar

Full Stack Developer & AI Practitioner

Loading amazing content...

Longest Substring Without Repeating Characters

Medium

Hash Table

String

Sliding Window

30 min

33.8%

Description

Problem

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

Examples

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.

Constraints

0 ≤ s.length ≤ 5 * 10⁴
s consists of English letters, digits, symbols and spaces.

Code Editor