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

Is Longest Substring Without Repeating Characters associated with Infosys?

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

Longest Substring Without Repeating Characters

Infosys● MediumNEW GRADONSITE INTERVIEW

Problem statement

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.

Function

lengthOfLongestSubstring(s: String) → int

Examples

Example 1

s = "abcabcbb"return = 3

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

Example 2

s = "bbbbb"return = 1

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

Constraints

0 <= s.length <= 5 * 10^4.
s contains only printable ASCII characters.