BackmediumStrings

Longest Distinct Character Substring Solution

Problem Statement

Given a string `s`, find the length of the longest contiguous substring that contains only unique characters (i.e., no character appears more than once in the substring).

Example 1

Input

s = "abcabcbb"

Output

Explanation: The longest contiguous substring without repeating characters is "abc", which has a length of 3.

Constraints

0 <= s.length <= 5 * 10^4
s consists of printable ASCII characters.

Longest Distinct Character Substring Solution

Problem Statement

Input

Output

Constraints

More Strings Problems

Optimized Approach

Step-by-Step Dry Run

Tested Solutions