terminal
Elevo
code
Topics
corporate_fare
Companies
history
History
arrow_back Back to Challenges

#3 Longest Substring Without Repeating Characters

Medium Acceptance 0%
Editorial
description

Problem Description

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

checklist Constraints

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

science Examples

Case #1

In: s = "abcabcbb"
Out: 3

Case #2

In: s = "bbbbb"
Out: 1

Case #3

In: s = "pwwkew"
Out: 3

Mastery Tags

Hash Table Sliding Window Strings

Hiring Companies

Amazon Bloomberg Google
code

Integrated IDE

Login to Compile
code_blocks
Coding
psychology
Aptitude