Skip to main content

Questions Categories Patterns Progress

CodeTutor - Coding Interview Preparation

Longest Substring Without Repeating Characters | CodeTutor

Longest Substring Without Repeating Characters

Medium

Strings Hash Tables Sliding Window

Problem

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

Constraints

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

Examples

Input: s = "abcabcbb"

Output: 3

The answer is 'abc', with length 3.

Input: s = "bbbbb"

Output: 1

The answer is 'b', with length 1.

Input: s = "pwwkew"

Output: 3

The answer is 'wke', with length 3. Note that 'pwke' is a subsequence, not a substring.

Loading...

Loading Python...