How should I practice Longest Substring Without Repeating Characters?

Start by reading the full statement, solve the visible examples, then compare the pattern against related ByteDance phone screen problems in FastPrep.

Is Longest Substring Without Repeating Characters associated with ByteDance?

FastPrep tags this as a ByteDance phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · String

Longest Substring Without Repeating Characters

Learn this problem

● Medium

ByteDanceFULLTIMEPHONE SCREEN

Problem statement

Given a string text, return the length of its longest contiguous substring whose characters are all distinct.

The empty string has answer 0.

Function

lengthOfLongestSubstring(text: String) → int

Examples

Example 1

text = "abcabcbb"return = 3

abc is a longest substring with no repeated character.

Example 2

text = "pwwkew"return = 3

wke has length three. The answer concerns a contiguous substring, not a subsequence.

Constraints

0 <= text.length() <= 100000
text contains only printable ASCII characters.