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 Akuna Capital online assessment problems in FastPrep.

Is Longest Substring Without Repeating Characters associated with Akuna Capital?

FastPrep tags this as a Akuna Capital online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · String

Longest Substring Without Repeating Characters

Learn this problem

● Medium

Akuna CapitalNEW GRADOA

Problem statement

Given a string s, return the length of its longest contiguous substring that contains no repeated characters.

Function

lengthOfLongestSubstring(s: String) → int

Examples

Example 1

s = "abcabcbb"return = 3

"abc" is a longest substring without repeated characters, so the answer is 3.

Example 2

s = "bbbbb"return = 1

Every substring with distinct characters contains at most one b.

Constraints

1 <= s.length <= 10^5.
s contains English letters, digits, and common symbols.