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

Is Longest Substring Without Repeating Characters associated with Wex?

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

Problem · String

● Medium

WexFULLTIMEPHONE SCREEN

You are given a string s consisting of printable ASCII characters.

Return the length of the longest substring of s that contains no repeated character.

The empty string has length 0.

lengthOfLongestSubstring(s: String) → int

s = "abcabcbb"return = 3

The substring abc has length 3 and no repeated character. Longer windows such as abca repeat a.

s = "bbbbb"return = 1

Every character is b, so the longest non-repeating substring has length 1.

s = "pwwkew"return = 3

The substring wke has length 3. The answer must be a contiguous substring, so pwke is not valid.