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

Is Longest Substring Without Repeating Characters associated with RedNote?

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

Problem · String

● Medium

RedNoteFULLTIMEPHONE SCREEN

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

The empty string has answer 0.

lengthOfLongestSubstring(text: String) → int

text = "abcabcbb"return = 3

abc is a longest substring with no repeated character.

text = "pwwkew"return = 3

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