Find longest substring without repeating characters

Q: Find longest substring without repeating characters

This question evaluates a candidate's skills in string manipulation, algorithm design, and reasoning about time and space complexity when identifying maximal contiguous substrings with distinct characters.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Problem

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

Input

s : a string (may contain letters, digits, symbols, and spaces).

Output

An integer: the maximum length of a substring of s with all distinct characters.

Examples

Input: "abcabcbb" → Output: 3 (e.g., "abc" )
Input: "bbbbb" → Output: 1 (e.g., "b" )
Input: "pwwkew" → Output: 3 (e.g., "wke" )

Constraints (typical)

0 <= len(s) <= 2 * 10^5

Notes

The substring must be contiguous (not a subsequence).