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

Is Longest Substring Without Repeating Characters associated with Netflix?

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

Problem · String

● Medium

NetflixFULLTIMEPHONE SCREEN

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

For this exercise, assume s contains printable ASCII characters. The empty string has answer 0.

lengthOfLongestSubstring(s: String) → int

s = "abcabcbb"return = 3

The substring abc has three distinct characters. Any longer substring repeats at least one character.

s = "pwwkew"return = 3

Both wke and kew have length 3. The answer concerns a contiguous substring, not a subsequence.

s = ""return = 0

The empty string contains no non-empty substring, so its longest valid length is 0.