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 Amazon onsite interview problems in FastPrep.

Is Longest Substring Without Repeating Characters associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

Longest Substring Without Repeating Characters

Amazon● MediumNEW GRADINTERNONSITE INTERVIEW

Problem statement

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

Function

lengthOfLongestSubstring(s: String) → int

Examples

Example 1

s = "abcabcbb"return = 3

abc is a longest substring with no repeated character.

Example 2

s = "bbbbb"return = 1

Every distinct-character substring contains at most one b.

Example 3

s = ""return = 0

The empty string has no nonempty substring.

Constraints

0 <= s.length <= 200000.
s contains printable ASCII characters.