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 Goldman Sachs phone screen problems in FastPrep.

Is Longest Substring Without Repeating Characters associated with Goldman Sachs?

FastPrep tags this as a Goldman Sachs 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

Goldman SachsFULLTIMEPHONE SCREEN

Problem statement

Return the length of the longest contiguous substring of s 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.

Constraints

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